Separation of partition inequalities with terminals

Authors:
Francisco Barahona;Hervé Kerivin
Affiliations:
IBM, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA;Institute for Mathematics and its Applications (IMA), University of Minnesota, 357 Lind Hall, 207 Church Street S.E., Minneapolis, MN 55455, USA
Venue:
Discrete Optimization
Year:
2004

Citing 11
Cited 0

Optimal attack and reinforcement of a network

Journal of the ACM (JACM)
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Integer polyhedra arising from certain network design problems with connectivity constraints

SIAM Journal on Discrete Mathematics
Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints

Operations Research
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Two-edge connected spanning subgraphs and polyhedra

Mathematical Programming: Series A and B
Separation of Partition Inequalities

Mathematics of Operations Research
A combinatorial algorithm minimizing submodular functions in strongly polynomial time

Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions

Journal of the ACM (JACM)
Separating from the dominant of the spanning tree polytope

Operations Research Letters
Separation of partition inequalities for the (1,2)-survivable network design problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph with n nodes each of them having labels equal either to 1 or 2 (a node with label 2 is called a terminal), we consider the (1,2)-survivable network design problem and more precisely, the separation problem for the partition inequalities. We show that this separation problem reduces to a sequence of submodular flow problems. Based on an algorithm developed by Fujishige and Zhang the problem is reduced to a sequence of O(n^4) minimum cut problems.