Strong formulations for network design problems with connectivity requirements

Authors:
Thomas L. Magnanti;S. Raghavan
Affiliations:
Sloan School of Management and Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;The Robert H. Smith School of Business and the Institute for Systems Research, Van Munching Hall, University of Maryland, College Park, Maryland 20742
Venue:
Networks
Year:
2005

Citing 0
Cited 11

Survivable Network Design: The State of the Art

Information Systems Frontiers
Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design

Computers and Operations Research
Strong Formulations for 2-Node-Connected Steiner Network Problems

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Connectivity Upgrade Models for Survivable Network Design

Operations Research
Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems

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

ESA'07 Proceedings of the 15th annual European conference on Algorithms
An exact algorithm for robust network design

INOC'11 Proceedings of the 5th international conference on Network optimization
Partition inequalities for capacitated survivable network design based on directed p-cycles

Discrete Optimization
Models and algorithms for robust network design with several traffic scenarios

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem

INFORMS Journal on Computing
Power optimization in ad hoc wireless network topology control with biconnectivity requirements

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The network design problem with connectivity requirements (NDC) includes as special cases a wide variety of celebrated combinatorial optimization problems including the minimum spanning tree, Steiner tree, and survivable network design problems. We develop strong formulations for two versions of the edge-connectivity NDC problem: unitary problems requiring connected network designs, and nonunitary problems permitting nonconnected networks as solutions. We (1) present a new directed formulation for the unitary NDC problem that is stronger than a natural undirected formulation; (2) project out two classes of valid inequalities—partition inequalities, and combinatorial design inequalities—that generalize known classes of valid inequalities for the Steiner tree problem to the unitary NDC problem; and (3) show how to strengthen and direct nonunitary problems. Our results provide a unifying framework for strengthening formulations for NDC problems, and demonstrate the power of flow-based formulations for network design problems with connectivity requirements. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45(2), 61–79 2005