Survivable Networks, Linear Programming Relaxations and the Parsimonious Property
Name
OR-225-90.pdf
Size
1.54 MB
Format
Adobe PDF
Checksum (MD5)
82efc5a62342c825d1769c69edaf5df7
Author(s)
Goemans, Michel X.
Bertsimas, Dimitris J.
Date Issued
June 1990
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 225-90
Abstract
We consider the survivable network design problem - the problem of designing, at minimum cost, a network with edge-connectivity requirements. As special cases, this problem encompasses the Steiner tree problem, the traveling salesman problem and the k-connected network design problem. We establish a property, referred to as the parsimonious property, of the linear programming (LP) relaxation of a classical formulation for the problem. The parsimonious property has numerous consequences. For example, we derive various structural properties of these LP relaxations, we present some algorithmic improvements and we perform tight worstcase analyses of two heuristics for the survivable network design problem.
Subjects
Keywords: network design, LP relaxations, worst-case analysis, heuristics.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
