Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Authors:
Markus Leitner;Günther R. Raidl
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria;Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
Journal of Mathematical Modelling and Algorithms
Year:
2011

Citing 15
Cited 3

Steiner problem in networks: a survey

Networks
Provisioning a virtual private network: a network design problem for multicommodity flow

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Solving Multiple Knapsack Problems by Cutting Planes

SIAM Journal on Optimization
The general Steiner tree-star problem

Information Processing Letters
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science
Building Steiner trees with incomplete global knowledge

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem

Management Science
Primal–Dual Algorithms for Connected Facility Location Problems

Algorithmica
Approximating connected facility location problems via random facility sampling and core detouring

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

SAINT '08 Proceedings of the 2008 International Symposium on Applications and the Internet
A GRASP Algorithm for the Connected Facility Location Problem

SAINT '08 Proceedings of the 2008 International Symposium on Applications and the Internet
A hybrid VNS for connected facility location

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
MIP models for connected facility location: A theoretical and computational study

Computers and Operations Research
Dual-Based Local Search for the Connected Facility Location and Related Problems

INFORMS Journal on Computing

Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

INFORMS Journal on Computing
A cutting plane algorithm for the Capacitated Connected Facility Location Problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a generalization of the Connected Facility Location Problem (ConFL), suitable to model real world network extension scenarios such as fiber-to-the-curb. In addition to choosing a set of facilities and connecting them by a Steiner tree as in ConFL, we aim to maximize the resulting profit by potentially supplying only a subset of all customers. Furthermore, capacity constraints on potential facilities need to be considered. We present two mixed integer programming based approaches which are solved using branch-and-cut and branch-and-cut-and-price, respectively. By studying the corresponding polyhedra we analyze both approaches theoretically and show their advantages over previously presented models. Furthermore, using a computational study we are able to additionally show significant advantages of our models over previously presented ones from a practical point of view.