Cutting plane versus compact formulations for uncertain (integer) linear programs
From MaRDI portal
Publication:2392865
DOI10.1007/S12532-012-0039-YzbMATH Open1275.90046OpenAlexW2078726782MaRDI QIDQ2392865FDOQ2392865
Matteo Fischetti, Michele Monaci
Publication date: 5 August 2013
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-012-0039-y
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
- Theory and Applications of Satisfiability Testing
- BerkMin: A fast and robust SAT-solver
- SCIP: solving constraint integer programs
- Title not available (Why is that?)
- The Price of Robustness
- Title not available (Why is that?)
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Conflict analysis in mixed integer programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust optimization-methodology and applications
- A Robust Optimization Perspective on Stochastic Programming
- Algorithms for the set covering problem
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Optimal speedup of Las Vegas algorithms
- The Probabilistic Set-Covering Problem
- MIP reformulations of the probabilistic set covering problem
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Minimum-weight two-connected spanning networks
- A Lagrangian-based heuristic for large-scale set covering problems
- Algorithms for railway crew management
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Information-based branching schemes for binary linear mixed integer problems
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Title not available (Why is that?)
Cited In (41)
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
- Projective Cutting-Planes
- Robust Network Design with Uncertain Outsourcing Cost
- 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
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- Exact solution of the robust knapsack problem
- Robust network design: Formulations, valid inequalities, and computations
- Comparative analysis of linear programming relaxations for the robust knapsack problem
- A dynamic programming approach for a class of robust optimization problems
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Multistage robust mixed-integer optimization with adaptive partitions
- A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty
- Robust min-max regret covering problems
- 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
- Multistage adaptive robust optimization for the unit commitment problem
- On the recoverable robust traveling salesman problem
- Deriving compact extended formulations via LP-based separation techniques
- RENS. The optimal rounding
- An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions
- Recycling inequalities for robust combinatorial optimization with budget uncertainty
- A branch and bound algorithm for robust binary optimization with budget uncertainty
- Exact approaches for solving robust prize-collecting Steiner tree problems
- Approach for multi-valued integer programming in multi-material topology optimization: random discrete steepest descent (RDSD) algorithm
- A relative robust approach on expected returns with bounded CVaR for portfolio selection
- Chance-constrained set covering with Wasserstein ambiguity
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints
- 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
- Deriving compact extended formulations via LP-based separation techniques
- Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios
- Thinning out Steiner trees: a node-based model for uniform edge costs
- A survey of nonlinear robust optimization
Uses Software
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)
