Pages that link to "Item:Q1240148"
From MaRDI portal
The following pages link to Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148):
Displaying 17 items.
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Lehman's forbidden minor characterization of ideal 0-1 matrices (Q686505) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- On a geometric property of perfect graphs (Q1053035) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- Discrete extremal problems (Q1152306) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Perfect graphs and norms (Q1177234) (← links)
- Local unimodularity of matrix-vector pairs (Q1253183) (← links)
- Near-perfect matrices (Q1332310) (← links)
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture (Q1837210) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- On perfect graphs and polyhedra with (0, 1)-valued extreme points (Q3208440) (← links)
- Norms and perfect graphs (Q4710897) (← links)
- On kernel-less clique-acyclic orientations of minimally imperfect graphs (Q5954249) (← links)
