Primal separation for 0/1 polytopes

DOI10.1007/S10107-002-0309-YMaRDI QIDQ1396830zbMATH OpenOpenAlexWikidataFDO

Authors Friedrich Eisenbrand, G. Rinaldi, P. Ventura

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

polytopecut polytopestable setbipartite subgraphmatching polytopes0/1 optimizationprimal separation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2119756
• Primal separation algorithms
• Integer Programming and Combinatorial Optimization
• A separation algorithm for the matchable set polytope
• On the relative complexity of 15 problems related to~0/1-integer programming

Cited in

(7)

• On the relative complexity of 15 problems related to~0/1-integer programming
• Optimal patchings for consecutive ones matrices
• scientific article; zbMATH DE number 1947419 (Why is no real title available?)
• On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
• Primal separation algorithms
• Integral simplex using decomposition with primal cutting planes
• scientific article; zbMATH DE number 2119756 (Why is no real title available?)

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

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