A Polyhedral Intersection Theorem for Capacitated Spanning Trees
Name
OR-207-89.pdf
Size
942.79 KB
Format
Adobe PDF
Checksum (MD5)
c35bf13959a23a7b35d885b27b04b69d
Author(s)
Hall, Leslie A.
Magnanti, Thomas L.
Date Issued
December 1989
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 207-89
Abstract
In 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.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
