Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design

Authors:
Meinolf Sellmann;Georg Kliewer;Achim Koberstein
Affiliations:
-;-;-
Venue:
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Year:
2002

Citing 6
Cited 8

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Minimum cost capacity installation for multicommodity network flows

Mathematical Programming: Series A and B - Special issue on computational integer programming
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Coupling Variable Fixing Algorithms for the Automatic Recording Problem

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

INFORMS Journal on Computing
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research

Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition

Proceedings of the 2005 ACM symposium on Applied computing
Length-Lex Bounds Consistency for Knapsack Constraints

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
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
Large-Scale, Less-than-Truckload Service Network Design

Operations Research
Alternating control tree search for knapsack/covering problems

Journal of Heuristics
Relax-and-cut for capacitated network design

ESA'05 Proceedings of the 13th annual European conference on Algorithms
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 a branch-and-bound approach for the Capacitated Network Design Problem. We focus on tightening strategies such as variable fixing and local cuts that can be applied in every search node. Different variable fixing algorithms based on Lagrangian relaxations are evaluated solitarily and in combined versions. Moreover, we develop cardinality cuts for the problem and evaluate their usefulness empirically by numerous tests.