Robust combinatorial optimization under convex and discrete cost uncertainty
From MaRDI portal
Publication:668950
DOI10.1007/S13675-018-0103-0zbMATH Open1417.90125OpenAlexW2892180720WikidataQ129293438 ScholiaQ129293438MaRDI QIDQ668950FDOQ668950
Authors: Christoph Buchheim, Jannis Kurtz 
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
Recommendations
- Solving robust two-stage combinatorial optimization problems under convex uncertainty
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- Robust combinatorial optimization with variable cost uncertainty
- Min-max-min robust combinatorial optimization
uncertaintycombinatorial optimizationcomplexityrobust optimization\(K\)-adaptabilitytwo-stage robustness
Cites Work
- Title not available (Why is that?)
- Recent advances in robust optimization: an overview
- Theory and applications of robust optimization
- The Price of Robustness
- Robust Solutions to Least-Squares Problems with Uncertain Data
- 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
- Light robustness
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Robust linear optimization under general norms.
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Interval data minmax regret network optimization problems
- Robust optimization-methodology and applications
- Robust convex optimization
- Robust Solutions to Uncertain Semidefinite Programs
- Generalized light robustness and the trade-off between robustness and nominal quality
- Multi-period portfolio optimization with linear control policies
- Robust optimization - a comprehensive survey
- Approximation algorithms for reliable stochastic combinatorial optimization
- Robust Combinatorial Optimization with Exponential Scenarios
- Adjustable robust solutions of uncertain linear programs
- Exact solution of the robust knapsack problem
- Design of near optimal decision rules in multistage adaptive mixed-integer optimization
- Generalized decision rule approximations for stochastic programming via liftings
- Robust combinatorial optimization with variable budgeted uncertainty
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
- The concept of recoverable robustness, linear programming recovery, and railway applications
- Heuristics for cardinality constrained portfolio optimization
- On the complexity of minmax regret linear programming
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Complexity of the min-max and min-max regret assignment problems
- Recoverable robust shortest path problems
- Recoverable robust knapsacks: \(\Gamma \)-scenarios
- Lagrangean decomposition for mean-variance combinatorial optimization
- Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions
- Min-max-min robust combinatorial optimization
- Recoverable robust knapsacks: the discrete scenario case
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- 2-stage robust MILP with continuous recourse variables
- Uncertain linear programs: extended affinely adjustable robust counterparts
- Optimality of affine policies in multistage robust optimization
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Constrained shortest path with uncertain transit times
- Primal and dual linear decision rules in stochastic and robust optimization
- Strong formulations of robust mixed 0-1 programming
- Multicriteria global minimum cuts
- Polymatroids and mean-risk minimization in discrete optimization
- Algorithms and Computation
- On the approximability of robust spanning tree problems
- A constraint sampling approach for multi-stage robust optimization
- Finite Adaptability in Multistage Linear Optimization
- Cutting-set methods for robust convex optimization with pessimizing oracles
- On the approximability of adjustable robust convex optimization under uncertainty
- \(K\)-adaptability in two-stage robust binary programming
- Two-Stage Robust Network Design with Exponential Scenarios
- An \(s\)-\(t\) connection problem with adaptability
- Algorithms – ESA 2005
- Robust network design with uncertain outsourcing cost
- 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
- \(K\)-adaptability in two-stage mixed-integer robust optimization
- 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
- Robust recoverable and two-stage selection problems
- Bulk-robust combinatorial 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
- Optimization under decision-dependent uncertainty
- Robust Two-Stage Network Problems
- Robust assignments via ear decompositions and randomized rounding
- Supermodularity and affine policies in dynamic robust optimization
- Recoverable Robust Combinatorial Optimization Problems
- Benders decomposition approach to robust mixed integer programming
Cited In (40)
- A note on robustness tolerances for combinatorial optimization problems
- Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty
- Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management
- Discrete optimization methods for group model selection in compressed sensing
- Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback
- Robust combinatorial optimization with variable cost uncertainty
- Oracle-based algorithms for binary two-stage robust optimization
- Minimizing recovery cost of network optimization problems
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- An approach to the distributionally robust shortest path problem
- An oracle-based framework for robust combinatorial optimization
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
- 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
- Combinatorial robust optimization with decision-dependent information discovery and polyhedral uncertainty
- Constant-ratio approximation for robust bin packing with budgeted uncertainty
- Combinatorial optimization under uncertainty
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Recycling inequalities for robust combinatorial optimization with budget uncertainty
- Mixed uncertainty sets for robust combinatorial optimization
- Min-max relative regret for scheduling to minimize maximum lateness
- Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
- On scenario aggregation to approximate robust combinatorial optimization problems
- On the complexity of robust bilevel optimization with uncertain follower's objective
- An exact algorithm for robust influence maximization
- Recoverable Robust Combinatorial Optimization Problems
- Data-driven robust optimization using deep neural networks
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty
- Pareto robust optimization on Euclidean vector spaces
- Optimizing subscriber migrations for a telecommunication operator in uncertain context
- On the multistage shortest path problem under distributional uncertainty
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
- Solving robust two-stage combinatorial optimization problems under convex uncertainty
- A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
- Dominance-based linear formulation for the anchor-robust project scheduling problem
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Uses Software
This page was built for publication: Robust combinatorial optimization under convex and discrete cost uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668950)
