Relax-and-cut for capacitated network design

Authors:
Georg Kliewer;Larissa Timajev
Affiliations:
Department of Computer Science, University of Paderborn, Germany;Department of Computer Science, University of Paderborn, Germany
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 6
Cited 4

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

Operations Research
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design

Journal of Heuristics

0-1 reformulations of the multicommodity capacitated network design problem

Discrete Applied Mathematics
Benders, metric and cutset inequalities for multicommodity capacitated network design

Computational Optimization and Applications
Lagrangian relaxation and cutting planes for the vertex separator problem

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A cutting plane algorithm for the Capacitated Connected Facility Location Problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 presented algorithm outperforms many other exact and heuristical solvers in terms of running time and solution quality.