On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints

DOI10.1007/978-3-540-78773-0_28zbMATH Open1136.90415OpenAlexW2144891260MaRDI QIDQ5458539FDOQ5458539

Authors: Gérard Cornuéjols, François Margot 

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_28

Recommendations

• On the facets of mixed integer programs with two integer variables and two constraints
• Description of 2-integer continuous knapsack polyhedra
• Minimal valid inequalities for integer constraints
• Mixing polyhedra with two non divisible coefficients
• Constrained infinite group relaxations of MIPs

zbMATH Keywords

integer programmingintersection cutgroup relaxation

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal valid inequalities for integer constraints
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Title not available (Why is that?)
• Some continuous functions related to corner polyhedra
• Chvátal closures for mixed integer programming problems
• Title not available (Why is that?)

Cited In (6)

• Two-step MIR inequalities for mixed integer programs
• Title not available (Why is that?)
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• Two row mixed-integer cuts via lifting
• Computing with Multi-row Gomory Cuts
• On the facets of mixed integer programs with two integer variables and two constraints

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)