Compact formulations for multi-depot routing problems: Theoretical and computational comparisons
Authors:
- Tolga BektaşTBTolga Bektaş
- Luís GouveiaLGLuís Gouveia
- Daniel SantosDSDaniel Santos
- 1 December 2020
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 124
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancingEuropean Journal of Operational Research, 2011
- A Branch-and-Cut method for the Capacitated Location-Routing ProblemComputers & Operations Research, 2011
- A comparative analysis of several asymmetric traveling salesman problem formulationsComputers & Operations Research, 2009
- On extended formulations for the precedence constrained asymmetric traveling salesman problemNetworks, 2006
- A compact model and tight bounds for a combined location-routing problemComputers & Operations Research, 2005
- The asymmetric travelling salesman problem and a reformulation of the Miller–Tucker–Zemlin constraintsEuropean Journal of Operational Research, 1999
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- An exact algorithm for solving a capacitated location-routing problemAnnals of Operations Research, 1986
- Hamiltonian location problemsEuropean Journal of Operational Research, 1983
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960