A computational comparison of flow formulations for the capacitated location-routing problem

  title={A computational comparison of flow formulations for the capacitated location-routing problem},
  author={Claudio Contardo and Jean-François Cordeau and Bernard Gendron},
  journal={Discrete Optimization},
In this paper we present a computational comparison of four different flow formulations for the capacitated location-routing problem. We introduce three new flow formulations for the problem, namely a two-index two-commodity flow formulation, a three-index vehicle-flow formulation and a three-index two-commodity flow formulation. We also consider the known two-index vehicle-flow formulation and extend it by considering new families of valid inequalities and separation algorithms. We introduce… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 25 references

A branchand-cut algorithm for the capacitated location routing problem

  • J. M. Belenguer, E. Benavent, C. Prins, C. Prodhon, R. Wolfler-Calvo
  • Computers & Operations Research, 38:931–941,
  • 2010
Highly Influential
7 Excerpts

The traveling salesman problem: a computational study

  • D. L. Applegate, R. E. Bixby, V. Chvátal, W. J. Cook
  • Princeton University Press,
  • 2007
3 Excerpts

A heuristic method for the combined location routing and inventory problem

  • S. C. Liu, C. C. Lin
  • International Journal of Advanced Manufacturing…
  • 2005
1 Excerpt

Análise e Modelização de Problemas de localização-distribuição

  • S. Barreto
  • PhD thesis, University of Aveiro, Campus…
  • 2004
2 Excerpts

Similar Papers

Loading similar papers…