COMPLEXITY OF VEHICLE ROUTING AND SCHEDULING PROBLEMS
J. K. Lenstra and
A. H. G. Rinnooy Kan
No 272191, Econometric Institute Archives from Erasmus University Rotterdam
Abstract:
The complexity of a class of vehicle routing and scheduling problems is investigated. We review known NP-hardness results and compile the results on the worst-case performance of approximation algorithms. Some directions for future research are suggested. The presentation is based on two discussion sessions during the Workshop to Investigate Future Directions in Routing and Scheduling of Vehicles and Crews, held at the University of Maryland at College Park from June 4 to June 6, 1979.
Keywords: Agricultural and Food Policy; Farm Management; Research Methods/ Statistical Methods (search for similar items in EconPapers)
Pages: 15
Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
https://ageconsearch.umn.edu/record/272191/files/erasmus119.pdf (application/pdf)
https://ageconsearch.umn.edu/record/272191/files/erasmus119.pdf?subformat=pdfa (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ags:eureia:272191
DOI: 10.22004/ag.econ.272191
Access Statistics for this paper
More papers in Econometric Institute Archives from Erasmus University Rotterdam Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search (aesearch@umn.edu).