Pages that link to "Item:Q1774172"
From MaRDI portal
The following pages link to Split closure and intersection cuts (Q1774172):
Displaying 34 items.
- 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)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← 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)
- MIR closures of polyhedral sets (Q847821) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Cook, Kannan and Schrijver's example revisited (Q955332) (← 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)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- The split closure of a strictly convex body (Q2275578) (← links)
- Lift-and-project for general two-term disjunctions (Q2339813) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- A constructive characterization of the split closure of a mixed integer linear program (Q2643814) (← links)
- Two-halfspace closure (Q2689824) (← links)
- The Chvátal closure of generalized stable sets in bidirected graphs (Q2840520) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- (Q4737523) (← links)
- On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width (Q4976155) (← links)
- Split Cuts in the Plane (Q5147031) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
