Primal separation for 0/1 polytopes

DOI10.1007/s10107-002-0309-yzbMath1023.90041OpenAlexW1991179071WikidataQ58002915 ScholiaQ58002915MaRDI QIDQ1396830

Friedrich Eisenbrand, Paolo Ventura, Giovanni Rinaldi

Publication date: 13 July 2003

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

Full work available at URL: https://doi.org/10.1007/s10107-002-0309-y

zbMATH Keywords

stable setpolytopecut polytopebipartite subgraphmatching polytopes0/1 optimizationprimal separation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (3)

Optimal patchings for consecutive ones matrices ⋮ Integral simplex using decomposition with primal cutting planes ⋮ On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming

This page was built for publication: Primal separation for 0/1 polytopes