A new sequential lifting of robust cover inequalities
From MaRDI portal
Publication:6492454
DOI10.1007/S11590-023-02027-3MaRDI QIDQ6492454
Publication date: 25 April 2024
Published in: Optimization Letters (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Robust optimization approach for a chance-constrained binary knapsack problem
- Exact solution of the robust knapsack problem
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- A robust approach to the chance-constrained knapsack problem
- The submodular knapsack polytope
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Lifting of probabilistic cover inequalities
- Recent advances in robust optimization: an overview
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
- Chance-Constrained Binary Packing Problems
- Easily Computable Facets of the Knapsack Polytope
- Theory and Applications of Robust Optimization
- The Price of Robustness
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Robust models for linear programming with uncertain right hand side
- Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
- Lifting and separation of robust cover inequalities
This page was built for publication: A new sequential lifting of robust cover inequalities
