Facets of the independent set polytope

DOI10.1007/s10107-003-0401-yzbMath1060.90078OpenAlexW2012125315MaRDI QIDQ1424284

Kevin Hooker, Eva K. Lee, Todd Easton

Publication date: 11 March 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0401-y

zbMATH Keywords

facetconflict hypergraphsindependent set polytope

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (6)

Knapsack polytopes: a survey ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model ⋮ Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph ⋮ Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization ⋮ On the structure of linear programs with overlapping cardinality constraints

This page was built for publication: Facets of the independent set polytope