Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- 13 June 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 166-174
- https://doi.org/10.1145/1007352.1007385
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Scheduling jobs in an Alcan aluminium foundry using a genetic algorithmInternational Journal of Production Research, 2000
- Survey of scheduling research involving setup timesInternational Journal of Systems Science, 1999
- Resource-constrained geometric network optimizationPublished by Association for Computing Machinery (ACM) ,1998
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting SalesmenSIAM Journal on Computing, 1998
- Vehicle Routing with Time Windows using Genetic AlgorithmsPublished by Taylor & Francis ,1995
- Algorithms for the Vehicle Routing Problems with Time DeadlinesAmerican Journal of Mathematical and Management Sciences, 1993
- The Orienteering Problem with Time WindowsJournal of the Operational Research Society, 1992
- Special cases of traveling salesman and repairman problems with time windowsNetworks, 1992
- Local search in routing problems with time windowsAnnals of Operations Research, 1985
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover CostsSIAM Journal on Computing, 1978