Pages that link to "Item:Q5624984"
From MaRDI portal
The following pages link to Intersection Cuts—A New Type of Cutting Planes for Integer Programming (Q5624984):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts (Q433114) (← links)
- Monoidal cut strengthening revisited (Q435731) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- Branching on general disjunctions (Q543420) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- A note on the MIR closure and basic relaxations of polyhedra (Q635512) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- Equivalence between intersection cuts and the corner polyhedron (Q974981) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
- Strengthening cuts for mixed integer programs (Q1142702) (← links)
- Reverse convex programming (Q1147072) (← links)
- Quasi-concave minimization subject to linear constraints (Q1215459) (← links)
- Improved convexity cuts for lattice point problems (Q1218339) (← links)
- First facets of the octahedron (Q1220872) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- General purpose heuristics for integer programming. I (Q1365114) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Intersection cuts -- standard versus restricted (Q1751139) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Disjunctive cuts for cross-sections of the second-order cone (Q1785397) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- Computational study of a family of mixed-integer quadratic programming problems (Q1814787) (← links)
- On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- A proof of Lovász's theorem on maximal lattice-free sets (Q1943344) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
