Show simple item record

dc.contributor.authorHall, Leslie A.en_US
dc.contributor.authorMagnanti, Thomas L.en_US
dc.date.accessioned2004-05-28T19:36:09Z
dc.date.available2004-05-28T19:36:09Z
dc.date.issued1989-12en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5370
dc.description.abstractIn a two-capacitated spanning tree of a complete graph with a distinguished root vertex v, every component of the induced subgraph on V\{v} has at most two vertices. We give a complete,non-redundant characterization of the polytope defined by the convex hull of the incidence vectors of two-capacitated spanning trees. This polytope is the intersection of the spanning tree polytope on the given graph and the matching polytope on the subgraph induced by removing the root node and its incident edges. This result is one of very few known cases in which the intersection of two integer polyhedra yields another integer polyhedron. We also give a complete polyhedral characterization of a related polytope, the 2-capacitated forest polytope.en_US
dc.format.extent965413 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesOperations Research Center Working Paper;OR 207-89en_US
dc.titleA Polyhedral Intersection Theorem for Capacitated Spanning Treesen_US
dc.typeWorking Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record