A compact model and tight bounds for a combined location-routing problem
- 31 March 2005
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 32 (3), 407-428
- https://doi.org/10.1016/s0305-0548(03)00245-4
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location ProblemJournal of the Operational Research Society, 2002
- Heuristic Procedures for Practical‐Sized Uncapacitated Location‐Capacitated Routing Problems*Decision Sciences, 1993
- Alternate solution procedures for the location-routing problemOmega, 1993
- Dynamic Location-routeing ProblemsJournal of the Operational Research Society, 1989
- An exact algorithm for solving a capacitated location-routing problemAnnals of Operations Research, 1986
- A branch and bound algorithm for the capacitated vehicle routing problemOR Spectrum, 1983
- A large scale location-allocation problem in the natural rubber industryEuropean Journal of Operational Research, 1981
- Multi-terminal vehicle-dispatch algorithmOmega, 1976
- Cost Functions in the Location of Depots for Multiple-Delivery JourneysJournal of the Operational Research Society, 1968
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960