On the membership problem for the \({0, 1/2}\)-closure
From MaRDI portal
Publication:408382
DOI10.1016/j.orl.2011.07.003zbMath1235.90094OpenAlexW1587779308WikidataQ57702174 ScholiaQ57702174MaRDI QIDQ408382
Sebastian Pokutta, Andreas S. Schulz, Adam N. Letchford
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/49608/1/10.pdf
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure, On the rational polytopes with Chvátal rank 1, High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
Cites Work
- Unnamed Item
- Unnamed Item
- Valid inequalities for mixed integer linear programs
- On the membership problem for the elementary closure of a polyhedron
- Separating lifted odd-hole inequalities to solve the index selection problem
- On the separation of split cuts and related inequalities
- Binary clutter inequalities for integer programs
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A connection between cutting plane theory and the geometry of numbers
- On the separation of maximally violated mod-\(k\) cuts
- Edmonds polytopes and a hierarchy of combinatorial problems
- Approximate fixed-rank closures of covering problems
- On the symmetric travelling salesman problem I: Inequalities
- On the acyclic subgraph polytope
- On Cutting Planes
- On the facial structure of set packing polyhedra
- Maximum matching and a polyhedron with 0,1-vertices
