Part of the Algorithms and Combinatorics book series (AC, volume 15)
As we will see throughout Part V, the cut polytope has many different types of facets, most of them having a rather complicated structure. Among them, the most simple ones are the triangle facets, i.e., those defined by the following triangle inequalities:for distinct i, j, k ∈ V n .
KeywordsTriangle Inequality Incidence Vector Linear Description Hilbert Basis Cycle Lattice
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1997