Vehicle routing with full loads
- 31 December 1988
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 15 (3), 219-226
- https://doi.org/10.1016/0305-0548(88)90034-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problemMathematical Modelling, 1987
- Vehicle routing via column generationEuropean Journal of Operational Research, 1985
- Routing with time windows by column generationNetworks, 1984
- Routing and scheduling of vehicles and crews: The state of the artComputers & Operations Research, 1983
- PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTIONDecision Sciences, 1983
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980
- Some Simple Applications of the Travelling Salesman ProblemJournal of the Operational Research Society, 1975