1. DSpace at MEDIU
  2. Harvested articles مقالات مستوردة من مؤسسات وجامعات عالمية
  3. MIT Items
Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5217
Full metadata record
DC FieldValueLanguage
dc.creatorGoemans, Michel X.-
dc.creatorBertsimas, Dimitris J.-
dc.date2004-05-28T19:28:34Z-
dc.date2004-05-28T19:28:34Z-
dc.date1990-06-
dc.date.accessioned2013-10-09T02:38:29Z-
dc.date.available2013-10-09T02:38:29Z-
dc.date.issued2013-10-09-
dc.identifierhttp://hdl.handle.net/1721.1/5217-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionWe 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.-
dc.format1615087 bytes-
dc.formatapplication/pdf-
dc.languageen_US-
dc.publisherMassachusetts Institute of Technology, Operations Research Center-
dc.relationOperations Research Center Working Paper;OR 225-90-
dc.subjectKeywords: network design, LP relaxations, worst-case analysis, heuristics.-
dc.titleSurvivable Networks, Linear Programming Relaxations and the Parsimonious Property-
dc.typeWorking Paper-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.