Routing with time windows by column generation
- 1 December 1984
- Vol. 14 (4), 545-565
- https://doi.org/10.1002/net.3230140406
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- 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
- Minimal Resources for Fixed and Variable Job SchedulesOperations Research, 1978
- Scheduling with earliest start and due date constraints on multiple machinesNaval Research Logistics Quarterly, 1975
- 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
- Minimizing the number of tankers to meet a fixed scheduleNaval Research Logistics Quarterly, 1954