The multiple TSP with time windows: vehicle bounds based on precedence graphs
Authors:
- 1 January 2006
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 34 (1) , 111-120
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu SearchTransportation Science, 1995
- A GRASP for the Vehicle Routing Problem with Time WindowsINFORMS Journal on Computing, 1995
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window ConstraintsOperations Research, 1987
- On the worst‐case performance of some heuristics for the vehicle routing and scheduling problem with time window constraintsNetworks, 1986
- Local search in routing problems with time windowsAnnals of Operations Research, 1985
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950