On the membership problem for the 0, 1/2-closure
From MaRDI portal
Publication:408382
Recommendations
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- scientific article; zbMATH DE number 124141
- On the transitive closure of reciprocal \([0, 1]\)-valued relations
- On closures of countable subsets of BN
- On a generalization of closed sets
- On \(\mathcal{T}\)-closed sets
- On the \(\gamma\)-interior and \(\gamma\)-closure of a set
- scientific article; zbMATH DE number 1791082
- scientific article; zbMATH DE number 2166040
Cites work
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A connection between cutting plane theory and the geometry of numbers
- Approximate fixed-rank closures of covering problems
- Binary clutter inequalities for integer programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- On Cutting Planes
- On the acyclic subgraph polytope
- On the facial structure of set packing polyhedra
- On the membership problem for the elementary closure of a polyhedron
- On the separation of maximally violated mod-\(k\) cuts
- On the separation of split cuts and related inequalities
- On the symmetric travelling salesman problem I: Inequalities
- Separating lifted odd-hole inequalities to solve the index selection problem
- Valid inequalities for mixed integer linear programs
Cited in
(10)- Binary clutter inequalities for integer programs
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- On the rational polytopes with Chvátal rank 1
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Deciding emptiness of the Gomory-Chvátal closure is NP-complete, even for a rational polyhedron containing no integer point
- Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
- Primal separation and approximation for the \(\{0,1/2\}\)-closure
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
This page was built for publication: On the membership problem for the \({0, 1/2}\)-closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408382)
