Pages that link to "Item:Q3115940"
From MaRDI portal
The following pages link to Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts (Q3115940):
Displaying 16 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- Branching on general disjunctions (Q543420) (← links)
- 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)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs (Q1707666) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
