Pages that link to "Item:Q5937498"
From MaRDI portal
The following pages link to Elementary closures for integer programs. (Q5937498):
Displayed 29 items.
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← 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)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Two row mixed-integer cuts via lifting (Q2638372) (← links)
- The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- (Q5092485) (← links)
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts (Q6086008) (← links)