Hamiltonian location problems
- 31 January 1983
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 12 (1) , 82-89
- https://doi.org/10.1016/0377-2217(83)90182-0
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- An exact algorithm for minimizing routing and operating costs in depot locationEuropean Journal of Operational Research, 1981
- A comparative study of heuristics for a two-level routing-location problemEuropean Journal of Operational Research, 1980
- A Cutting Planes Algorithm for the m-Salesmen ProblemJournal of the Operational Research Society, 1980
- A Transportation Location-Allocation Model for Regional Blood BankingA I I E Transactions, 1979
- Methodological Choices in Depot Location StudiesJournal of the Operational Research Society, 1976
- Depot location with van salesmen — A practical approachOmega, 1973
- Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery PointsJournal of the Operational Research Society, 1972
- Expected Distances in Distribution ProblemsJournal of the Operational Research Society, 1969
- Cost Functions in the Location of Depots for Multiple-Delivery JourneysJournal of the Operational Research Society, 1968
- Heuristic Methods for Location-Allocation ProblemsSIAM Review, 1964