Cutting plane versus compact formulations for uncertain (integer) linear programs
From MaRDI portal
Publication:2392865
Recommendations
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- Split cuts for robust mixed-integer optimization
- Robust solutions of uncertain linear programs
- Cutset inequalities for robust network design
- Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2159471 (Why is no real title available?)
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- A Lagrangian-based heuristic for large-scale set covering problems
- A Robust Optimization Perspective on Stochastic Programming
- Algorithms for railway crew management
- Algorithms for the set covering problem
- BerkMin: A fast and robust SAT-solver
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Conflict analysis in mixed integer programming
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Information-based branching schemes for binary linear mixed integer problems
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- MIP reformulations of the probabilistic set covering problem
- Minimum-weight two-connected spanning networks
- Optimal speedup of Las Vegas algorithms
- Robust discrete optimization and network flows
- Robust optimization-methodology and applications
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- SCIP: solving constraint integer programs
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The Probabilistic Set-Covering Problem
- Theory and Applications of Satisfiability Testing
Cited in
(41)- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
- The multi-band robust knapsack problem -- a dynamic programming approach
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
- Robust strategic planning for mobile medical units with steerable and unsteerable demands
- Robust multicovers with budgeted uncertainty
- Exact solution of the robust knapsack problem
- Probabilistic partial set covering with an oracle for chance constraints
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- A dynamic programming approach for a class of robust optimization problems
- Comparative analysis of linear programming relaxations for the robust knapsack problem
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Multistage robust mixed-integer optimization with adaptive partitions
- Robust min-max regret covering problems
- Projective cutting-planes
- An oracle-based framework for robust combinatorial optimization
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- Improved handling of uncertainty and robustness in set covering problems
- Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization
- On the recoverable robust traveling salesman problem
- Multistage adaptive robust optimization for the unit commitment problem
- RENS. The optimal rounding
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- Deriving compact extended formulations via LP-based separation techniques
- Recycling inequalities for robust combinatorial optimization with budget uncertainty
- Robust network design: formulations, valid inequalities, and computations
- Exact approaches for solving robust prize-collecting Steiner tree problems
- A branch and bound algorithm for robust binary optimization with budget uncertainty
- A relative robust approach on expected returns with bounded CVaR for portfolio selection
- Approach for multi-valued integer programming in multi-material topology optimization: random discrete steepest descent (RDSD) algorithm
- Robust network design with uncertain outsourcing cost
- A new theoretical framework for robust optimization under multi-band uncertainty
- Chance-constrained set covering with Wasserstein ambiguity
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Deriving compact extended formulations via LP-based separation techniques
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
- Thinning out Steiner trees: a node-based model for uniform edge costs
- A survey of nonlinear robust optimization
This page was built for publication: Cutting plane versus compact formulations for uncertain (integer) linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392865)
