Amanote Research

Amanote Research

    RegisterSign In

Min-MaxK-Vehicles Windy Rural Postman Problem

Networks - United States
doi 10.1002/net.20334
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
Date

December 1, 2009

Authors
Enrique BenaventAngel CorberánIsaac PlanaJosé M. Sanchis
Publisher

Wiley


Related search

A Heuristic for the Periodic Rural Postman Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2005English

Route Management for Vehicles Used in Road Maintenance Activities Through Hierarchical Chinese Postman Problem Approach

Journal of the Institute of Science and Technology
2018English

A New View on Rural Postman Based on Eulerian Extension and Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Facility Location Problem Under Users With Two Type Criteria, Min-Max and Max-Min

International Journal of Japan Association for Management Systems
2015English

Max–min Method to Solve Fuzzy Transshipment Problem

Applied Mathematical Sciences
2015English

The Rural Problem.

1917English

Approximation Schemes for the Min-Max Starting Time Problem

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2004English

Renewable Energy: Beijing's Windy Bet

Nature
Multidisciplinary
2009English

The Rural Sewage Problem

American Journal of Public Health
1916English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy