Pages that link to "Item:Q2436649"
From MaRDI portal
The following pages link to An algorithm for the separation of two-row cuts (Q2436649):
Displayed 9 items.
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- The (not so) trivial lifting in two dimensions (Q2281447) (← links)
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs (Q2340339) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
- Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case (Q5245017) (← links)