Applying Lehman's theorems to packing problems (Q1919808)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applying Lehman's theorems to packing problems |
scientific article; zbMATH DE number 910017
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applying Lehman's theorems to packing problems |
scientific article; zbMATH DE number 910017 |
Statements
Applying Lehman's theorems to packing problems (English)
0 references
18 September 1996
0 references
A matrix \(A\) is ideal if the polyhedron \(\{x\in Q^V \mid A \cdot x\geq 1\) and \(x\geq 0\}\) is integral, and perfect if the polyhedron \(\{x\in Q^V \mid A \cdot x\leq 1\) and \(x\geq 0\}\) is integral. The author gives a bijection between superclasses of the classes of ideal and perfect matrices, obtaining new results on packing polyhedra and stable set polytopes of near-bipartite graphs (deletion of any neighbourhood results in a bipartite graph) and some other classes of graphs.
0 references
ideal matrix
0 references
blocking matrix
0 references
total dual integrability
0 references
perfect matrices
0 references
packing polyhedra
0 references
stable set polytopes
0 references
0 references