Robust combinatorial optimization under convex and discrete cost uncertainty
From MaRDI portal
Publication:668950
DOI10.1007/s13675-018-0103-0zbMath1417.90125OpenAlexW2892180720WikidataQ129293438 ScholiaQ129293438MaRDI QIDQ668950
Jannis Kurtz, Christoph Buchheim
Publication date: 19 March 2019
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-018-0103-0
complexityuncertaintycombinatorial optimizationrobust optimization\(K\)-adaptabilitytwo-stage robustness
Related Items (27)
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective ⋮ Radius of Robust Feasibility for Mixed-Integer Problems ⋮ A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set ⋮ An approach to the distributionally robust shortest path problem ⋮ Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management ⋮ Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions ⋮ Data-driven robust optimization using deep neural networks ⋮ Mixed uncertainty sets for robust combinatorial optimization ⋮ A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty ⋮ Minimizing recovery cost of network optimization problems ⋮ Min-max relative regret for scheduling to minimize maximum lateness ⋮ An oracle-based framework for robust combinatorial optimization ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Pareto robust optimization on Euclidean vector spaces ⋮ On the multistage shortest path problem under distributional uncertainty ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ Dominance-based linear formulation for the anchor-robust project scheduling problem ⋮ Oracle-based algorithms for binary two-stage robust optimization ⋮ An exact algorithm for robust influence maximization ⋮ An active set algorithm for robust combinatorial optimization based on separation oracles ⋮ On the complexity of robust bilevel optimization with uncertain follower's objective ⋮ Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty ⋮ Optimizing subscriber migrations for a telecommunication operator in uncertain context ⋮ Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
Uses Software
Cites Work
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
- Exact solution of the robust knapsack problem
- A constraint sampling approach for multi-stage robust optimization
- Generalized light robustness and the trade-off between robustness and nominal quality
- Generalized decision rule approximations for stochastic programming via liftings
- Constrained shortest path with uncertain transit times
- Min-max-min robust combinatorial optimization
- An \(s\)-\(t\) connection problem with adaptability
- On the approximability of robust spanning tree problems
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Primal and dual linear decision rules in stochastic and robust optimization
- Recoverable robust knapsacks: the discrete scenario case
- Robust linear optimization under general norms.
- Complexity of the min-max and min-max regret assignment problems
- Polymatroids and mean-risk minimization in discrete optimization
- Multi-period portfolio optimization with linear control policies
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust optimization - a comprehensive survey
- Robust solutions of uncertain linear programs
- Geometric algorithms and combinatorial optimization.
- Minimax regret solution to linear programming problems with an interval objective function
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- Heuristics for cardinality constrained portfolio optimization
- Robust combinatorial optimization with knapsack uncertainty
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
- A survey of adjustable robust optimization
- The multi-band robust knapsack problem -- a dynamic programming approach
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Interval data minmax regret network optimization problems
- Robust optimization-methodology and applications
- On the complexity of minmax regret linear programming
- Robust combinatorial optimization with variable budgeted uncertainty
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- Recent advances in robust optimization: an overview
- A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
- A dynamic programming approach to adjustable robust optimization
- The recoverable robust spanning tree problem with interval costs is polynomially solvable
- On the approximability of adjustable robust convex optimization under uncertainty
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Robust recoverable and two-stage selection problems
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- 2-stage robust MILP with continuous recourse variables
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Strong formulations of robust mixed 0-1 programming
- Multicriteria global minimum cuts
- Bulk-robust combinatorial optimization
- Robust Convex Optimization
- Robust Critical Node Selection by Benders Decomposition
- Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
- Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
- Recoverable robust shortest path problems
- Recoverable Robust Knapsacks: Γ-Scenarios
- Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
- Theory and Applications of Robust Optimization
- Optimality of Affine Policies in Multistage Robust Optimization
- Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
- Robust Network Design with Uncertain Outsourcing Cost
- K-Adaptability in Two-Stage Robust Binary Programming
- Two-Stage Robust Network Design with Exponential Scenarios
- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
- Cutting-set methods for robust convex optimization with pessimizing oracles
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Light Robustness
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Optimization under Decision-Dependent Uncertainty
- Robust Two-Stage Network Problems
- Robust Assignments via Ear Decompositions and Randomized Rounding
- Finite Adaptability in Multistage Linear Optimization
- Supermodularity and Affine Policies in Dynamic Robust Optimization
- Recoverable Robust Combinatorial Optimization Problems
- Robust Combinatorial Optimization with Exponential Scenarios
- Algorithms – ESA 2005
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Algorithms and Computation
- Unnamed Item
- Unnamed Item
This page was built for publication: Robust combinatorial optimization under convex and discrete cost uncertainty
