On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
From MaRDI portal
Publication:5458539
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 4119933 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Chvátal closures for mixed integer programming problems
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Minimal valid inequalities for integer constraints
- Some continuous functions related to corner polyhedra
Cited in
(6)- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Two-step MIR inequalities for mixed integer programs
- On the facets of mixed integer programs with two integer variables and two constraints
- scientific article; zbMATH DE number 1405787 (Why is no real title available?)
- Two row mixed-integer cuts via lifting
- Computing with Multi-row Gomory Cuts
This page was built for publication: On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458539)