Robust combinatorial optimization with knapsack uncertainty

DOI10.1016/j.disopt.2017.09.004zbMath1506.90230OpenAlexW2620153647MaRDI QIDQ1662111

Michael Poss

Publication date: 17 August 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2017.09.004

zbMATH Keywords

combinatorial optimizationrobust optimizationapproximation algorithmsellipsoidal uncertainty

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Related Items (16)

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ The min-p robust optimization approach for facility location problem under uncertainty ⋮ Robust combinatorial optimization with locally budgeted uncertainty ⋮ Proportional and maxmin fairness for the sensor location problem with chance constraints ⋮ Robust Optimization with Continuous Decision-Dependent Uncertainty with applications to demand response management ⋮ Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions ⋮ Mixed uncertainty sets for robust combinatorial optimization ⋮ Single machine robust scheduling with budgeted uncertainty ⋮ A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty ⋮ Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty

Cites Work

• Robust combinatorial optimization with variable cost uncertainty
• Constrained shortest path with uncertain transit times
• On robust maximum flow with polyhedral uncertainty sets
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Polymatroids and mean-risk minimization in discrete optimization
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust combinatorial optimization with variable budgeted uncertainty
• A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
• Robust capacity assignment solutions for telecommunications networks with uncertain demands
• The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
• Optimization over Integers with Robustness in Cost and Few Constraints
• Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
• Provisioning virtual private networks under traffic uncertainty
• Robust Network Design with Uncertain Outsourcing Cost
• Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
• The Price of Robustness
• Designing Least-Cost Nonblocking Broadband Networks
• Optimization under Decision-Dependent Uncertainty
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust combinatorial optimization with knapsack uncertainty