A new ILP formulation for 2-root-connected prize-collecting Steiner networks

Authors:
Markus Chimani;Maria Kandyba;Petra Mutzel
Affiliations:
Department of Computer Science, University of Dortmund, Germany;Department of Computer Science, University of Dortmund, Germany;Department of Computer Science, University of Dortmund, Germany
Venue:
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Year:
2007

Citing 6
Cited 5

Steiner problem in networks: a survey

Networks
The equivalent subgraph and directed cut polyhedra on series-parallel graphs

SIAM Journal on Discrete Mathematics
The prize collecting Steiner tree problem: theory and practice

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Strong lower bounds for the prize collecting Steiner problem in graphs

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Strong formulations for network design problems with connectivity requirements

Networks
Design of Survivable Networks: A survey

Networks

Strong Formulations for 2-Node-Connected Steiner Network Problems

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements

Approximation and Online Algorithms
Obtaining optimal k-cardinality trees fast

Journal of Experimental Algorithmics (JEA)
Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this problem can be formulated as a 2-root-connected prize-collecting Steiner network problem in which certain customer nodes require two node-disjoint paths to the root, and other customers only a simple path. Herein, we present a novel ILP approach to solve this problem to optimality based on directed cuts. This formulation becomes possible by exploiting a certain orientability of the given graph. To our knowledge, this is the first time that such an argument is used for a problem with node-disjointness constraints. We prove that this formulation is stronger than the well-known undirected cut approach. Our experiments show its efficiency over the other formulations presented for this problem, i.e., the undirected cut approach and a formulation based on multi-commodity flow.