Pages that link to "Item:Q2436641"
From MaRDI portal
The following pages link to Coordinated cutting plane generation via multi-objective separation (Q2436641):
Displaying 10 items.
- Approximating polyhedra with sparse inequalities (Q896289) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- Sparse PSD approximation of the PSD cone (Q2118107) (← links)
- Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets (Q2241901) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
