Relax-and-Cut for Capacitated Network Design

@inproceedings{Kliewer2005RelaxandCutFC,
  title={Relax-and-Cut for Capacitated Network Design},
  author={Georg Kliewer and Larissa Timajev},
  booktitle={ESA},
  year={2005}
}
We present an evaluation of a Lagrangean-based branch-and-bound algorithm with additional valid inequalities for the capacitated network design problem. The focus is on two types of valid inequalities, the cover inequalities and local cuts. We show how these inequalities can be considered in a Lagrangean relaxation without destroying the computationally simple structure of the subproblems. We present an extensive computational study on a large set of benchmark data. The results show that the… CONTINUE READING

Citations

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

Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design

  • EURO J. Computational Optimization
  • 2014
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Node-Based Lagrangian Relaxations for Multicommodity Capacitated Fixed-Charge Network Design

Mohammad Rahim Akhavan Kazemzadeh, Teodor Gabriel, +3 authors Enrico Gorgone
  • 2019
VIEW 1 EXCERPT
CITES METHODS