Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
- 1 June 1981
- Vol. 11 (2) , 179-213
- https://doi.org/10.1002/net.3230110209
Abstract
No abstract availableKeywords
This publication has 77 references indexed in Scilit:
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Models for rail transportationTransportation Research Part A: General, 1980
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Nature ,1980
- Evaluating a Sequential Vehicle Routing AlgorithmA I I E Transactions, 1977
- The “Hub” and “Wheel” Scheduling ProblemsTransportation Science, 1977
- OPTIMIZATION FOR SPARSE SYSTEMSPublished by Elsevier ,1976
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965