Pages that link to "Item:Q896289"
From MaRDI portal
The following pages link to Approximating polyhedra with sparse inequalities (Q896289):
Displayed 15 items.
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
- Sparse PSD approximation of the PSD cone (Q2118107) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- Sparsity of integer formulations for binary programs (Q2294334) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)