Cutting plane versus compact formulations for uncertain (integer) linear programs
From MaRDI portal
Publication:2392865
DOI10.1007/s12532-012-0039-yzbMath1275.90046OpenAlexW2078726782MaRDI QIDQ2392865
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
Related Items
A survey of nonlinear robust optimization, Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems, Robust Network Design with Uncertain Outsourcing Cost, On the recoverable robust traveling salesman problem, Exact solution of the robust knapsack problem, Robust min-max regret covering problems, Robust network design: Formulations, valid inequalities, and computations, 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, Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions, Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Improved handling of uncertainty and robustness in set covering problems, Chance-constrained set covering with Wasserstein ambiguity, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, Comparative analysis of linear programming relaxations for the robust knapsack problem, A branch and bound algorithm for robust binary optimization with budget uncertainty, An oracle-based framework for robust combinatorial optimization, Thinning out Steiner trees: a node-based model for uniform edge costs, Deriving compact extended formulations via LP-based separation techniques, Probabilistic Partial Set Covering with an Oracle for Chance Constraints, Robust combinatorial optimization under convex and discrete cost uncertainty, Robust strategic planning for mobile medical units with steerable and unsteerable demands, A relative robust approach on expected returns with bounded CVaR for portfolio selection, Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios, The multi-band robust knapsack problem -- a dynamic programming approach, Robust multicovers with budgeted uncertainty, Deriving compact extended formulations via LP-based separation techniques, A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty, Multistage Adaptive Robust Optimization for the Unit Commitment Problem, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, RENS. The optimal rounding, Approximate cutting plane approaches for exact solutions to robust optimization problems, A Dynamic Programming Approach for a Class of Robust Optimization Problems, Projective Cutting-Planes, Multistage Robust Mixed-Integer Optimization with Adaptive Partitions, Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds, Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios, Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem, Exact approaches for solving robust prize-collecting Steiner tree problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum-weight two-connected spanning networks
- Optimal speedup of Las Vegas algorithms
- SCIP: solving constraint integer programs
- MIP reformulations of the probabilistic set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- Robust solutions of uncertain linear programs
- Algorithms for railway crew management
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust optimization-methodology and applications
- Information-based branching schemes for binary linear mixed integer problems
- Conflict analysis in mixed integer programming
- BerkMin: A fast and robust SAT-solver
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- A Robust Optimization Perspective on Stochastic Programming
- The Probabilistic Set-Covering Problem
- The Price of Robustness
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Theory and Applications of Satisfiability Testing
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Algorithms for the set covering problem
