For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of the incidence vectors of all nonempty edge cutsets of G. We give some properties of the facial structure of cut(G). In particular, we characterize all of the facet-inducing inequalities with right-hand side at most 2. These include all of the rank facets of cut(G).

On the cut polyhedron

Rinaldi G;
2004

Abstract

For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of the incidence vectors of all nonempty edge cutsets of G. We give some properties of the facial structure of cut(G). In particular, we characterize all of the facet-inducing inequalities with right-hand side at most 2. These include all of the rank facets of cut(G).
2004
Istituto di Analisi dei Sistemi ed Informatica ''Antonio Ruberti'' - IASI
Cut polyhedron
Minimum cut
Facet-inducing inequality
Rank inequality
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/169398
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 6
social impact