Generalized intersection cuts and a new cut generating paradigm
From MaRDI portal
Publication:1942255
DOI10.1007/S10107-011-0483-XzbMATH Open1262.90099OpenAlexW2104477931MaRDI QIDQ1942255FDOQ1942255
Publication date: 18 March 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0483-x
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Strengthening cuts for mixed integer programs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- 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
- Some continuous functions related to corner polyhedra
- Chvátal closures for mixed integer programming problems
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
- On the separation of disjunctive cuts
- Strengthening Gomory Mixed-Integer Cuts
Cited In (22)
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Disjunctive programming and relaxations of polyhedra
- Intersection cuts for convex mixed integer programs from translated cones
- Theoretical challenges towards cutting-plane selection
- A generalized \(\alpha\)-cut
- Multirow Intersection Cuts Based on the Infinity Norm
- A disjunctive cut strengthening technique for convex MINLP
- Reflections on generating (disjunctive) cuts
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Title not available (Why is that?)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
- Partial hyperplane activation for generalized intersection cuts
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Intersection cuts from multiple rows: a disjunctive programming approach
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- Split closure and intersection cuts
- Title not available (Why is that?)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- The generalized good cut equation
- Intersection cuts for single row corner relaxations
- Intersection Disjunctions for Reverse Convex Sets
This page was built for publication: Generalized intersection cuts and a new cut generating paradigm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1942255)
