Almost integral polyhedra related to certain combinatorial optimization problems

DOI10.1016/0024-3795(76)90079-3zbMath0362.90077OpenAlexW1965529449MaRDI QIDQ1240148

Manfred W. Padberg

Publication date: 1976

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(76)90079-3

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Near-perfect matrices, Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs, The Boolean quadratic polytope: Some characteristics, facets and relatives, On perfect graphs and polyhedra with (0, 1)-valued extreme points, Applying Lehman's theorems to packing problems, Graphical properties related to minimal imperfection, Discrete extremal problems, A stronger LP bound for formula size lower bounds via clique constraints, On stable set polyhedra for K//(1,3)free graphs, Perfect graphs and norms, Lehman's forbidden minor characterization of ideal 0-1 matrices, On kernel-less clique-acyclic orientations of minimally imperfect graphs, Local unimodularity of matrix-vector pairs, Norms and perfect graphs, Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture, The strong perfect graph conjecture: 40 years of attempts, and its resolution, On a geometric property of perfect graphs

Cites Work

• Anti-blocking polyhedra
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices
• Remarks on a Problem of Moser
• Canonical Cuts on the Unit Hypercube
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item