A new formulation for the Traveling Deliveryman Problem
Authors:
- Isabel Méndez-DíazIMIsabel Méndez-Díaz
- Paula ZabalaPZPaula Zabala
- Abilio LucenaALAbilio Lucena
- 1 October 2008
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 156 (17) , 3223-3237
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Exact algorithms for the minimum latency problemInformation Processing Letters, 2004
- News from the online traveling repairmanTheoretical Computer Science, 2003
- On-line single-server dial-a-ride problemsTheoretical Computer Science, 2001
- On Salesmen, Repairmen, Spiders, and Other Traveling Agents2000
- An improved approximation ratio for the minimum latency problemMathematical Programming, 1998
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- Minimizing the Total Flow Time of n Jobs on a NetworkIIE Transactions, 1991
- Time‐dependent traveling salesman problem–the deliveryman caseNetworks, 1990
- Facets of the linear ordering polytopeMathematical Programming, 1985
- P-Complete Approximation ProblemsJournal of the ACM, 1976