期刊名称：CORE Discussion Papers / Center for Operations Research and Econometrics (UCL), Louvain
出版年度：2000
卷号：2000
出版社：Center for Operations Research and Econometrics (UCL), Louvain
摘要：The cut polyhedron cut(G) of an undirected graph G =(V,E) is the dom-
inant of the convex hull of all of its nonempty edge cutsets. After examining
various compact extended formulations for cut(G), we study some of its poly-
hedral properties. In particular, we characterize all of the facets induced by
inequalities with right-hand side at most 2. These include all of the rank facets
of the polyhedron.
