Primal separation for 0/1 polytopes

DOI10.1007/S10107-002-0309-YzbMATH Open1023.90041OpenAlexW1991179071WikidataQ58002915 ScholiaQ58002915MaRDI QIDQ1396830FDOQ1396830

Friedrich Eisenbrand, P. Ventura, G. 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

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)

Cited In (7)

• On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
• Primal separation algorithms
• Optimal patchings for consecutive ones matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integral simplex using decomposition with primal cutting planes
• On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)