Routing problems: A bibliography
- 1 December 1995
- journal article
- research article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 61 (1), 227-262
- https://doi.org/10.1007/bf02098290
Abstract
No abstract availableKeywords
This publication has 101 references indexed in Scilit:
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraintsOR Spectrum, 1992
- Quick updates for p-opt TSP heuristicsOperations Research Letters, 1992
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- Time‐dependent traveling salesman problem–the deliveryman caseNetworks, 1990
- Classification of travelling salesman problem formulationsOperations Research Letters, 1990
- 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 computational comparison of algorithms for the inventory routing problemAnnals of Operations Research, 1985
- A fundamental problem in vehicle routingNetworks, 1974