An integer polyhedron related to the design of survivable communication networks.

dc.contributor.author	Hao, Tianbao.
dc.date.accessioned	2009-03-23T16:03:56Z
dc.date.available	2009-03-23T16:03:56Z
dc.date.created	1991
dc.date.issued	1991
dc.degree.level	Masters
dc.degree.name	M.C.Sc.
dc.description.abstract	The linear programming cutting plane method has proven to be quite successful for solving certain "hard" combinatorial optimization problems, c.f. (1), (6), (12), (24), (26). A great deal of this success is due to the use of problem specific cutting planes which define facets of the underlying integer polyhedra. In this paper, we introduce a new class of valid inequalities for the polytope associated with the minimum cost 2-edge-connected subgraph problem, and give necessary and sufficient conditions for these inequalities to be facet inducing for this polytope. We believe it will be possible to use these inequalities efficiently in a cutting plane procedure for designing minimum cost survivable communication networks.
dc.format.extent	62 p.
dc.identifier.citation	Source: Masters Abstracts International, Volume: 31-01, page: 0345.
dc.identifier.isbn	9780315680937
dc.identifier.uri	http://hdl.handle.net/10393/7818
dc.identifier.uri	http://dx.doi.org/10.20381/ruor-15519
dc.publisher	University of Ottawa (Canada)
dc.subject.classification	Computer Science.
dc.title	An integer polyhedron related to the design of survivable communication networks.
dc.type	Thesis

Files

Now showing 1 - 1 of 1