Methods for routing with time windows
- 28 February 1986
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 23 (2), 236-245
- https://doi.org/10.1016/0377-2217(86)90243-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Routing with time windows by column generationNetworks, 1984
- Plus court chemin avec contraintes d'horairesRairo-Operations Research, 1983
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980
- Scheduling and Fleet Routing Models for Transportation SystemsTransportation Science, 1971
- Pathology of Traveling-Salesman Subtour-Elimination AlgorithmsOperations Research, 1971
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960