Almost integral polyhedra related to certain combinatorial optimization problems

DOI10.1016/0024-3795(76)90079-3MaRDI QIDQ1240148zbMATH OpenOpenAlexFDO

Authors Manfred 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)

Cites work

• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3485516 (Why is no real title available?)
• scientific article; zbMATH DE number 3495859 (Why is no real title available?)
• scientific article; zbMATH DE number 3513556 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3322855 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• scientific article; zbMATH DE number 3390792 (Why is no real title available?)
• scientific article; zbMATH DE number 3400670 (Why is no real title available?)
• scientific article; zbMATH DE number 3420800 (Why is no real title available?)
• A characterization of perfect graphs
• Anti-blocking polyhedra
• Blocking and anti-blocking pairs of polyhedra
• Canonical Cuts on the Unit Hypercube
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices
• Remarks on a Problem of Moser

Cited in

(17)

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

This page was built for publication: Almost integral polyhedra related to certain combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1240148)