Lagrangean relaxation for the capacitated hub location problem with single assignment

@article{Contreras2009LagrangeanRF,
  title={Lagrangean relaxation for the capacitated hub location problem with single assignment},
  author={Iv{\'a}n A. Contreras and Juan A. D{\'i}az and Elena Fern{\'a}ndez},
  journal={OR Spectrum},
  year={2009},
  volume={31},
  pages={483-505}
}
This article considers the capacitated hub location problem with single assignment. We propose a Lagrangean relaxation to obtain tight upper and lower bounds. The Lagrangean function that we formulate exploits the structure of the problem and can be decomposed into smaller subproblems that can be solved efficiently. In addition, we present some simple reduction tests, based on the Lagrangean relaxation bounds that allows us to reduce considerably the size of the formulation and thus, to reduce… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 40 CITATIONS

General network design: A unified view of combined location and network design problems

  • European Journal of Operational Research
  • 2012
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Lagrangian Relaxation for q-Hub Arc Location Problems

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

An improved Benders decomposition algorithm for the tree of hubs location problem

  • European Journal of Operational Research
  • 2013
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Multi-Period Modular Capacitated Hub Location Problem with a Splittable Flow of Commodities and Multimodal Transportation System

  • 2019 15th Iran International Industrial Engineering Conference (IIIEC)
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Similar Papers