The robust knapsack problem with queries

DOI10.1016/j.cor.2014.09.010zbMath1348.90541OpenAlexW2077048701MaRDI QIDQ337391

Jonas Ide, Manoj Gupta, Marc Goerigk, Anita Schöbel, Sandeep Sen

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.09.010

zbMATH Keywords

robust optimizationcompetitivenessqueriesrobust knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (17)

Scheduling with testing on multiple identical parallel machines ⋮ Two-stage robust optimization problems with two-stage uncertainty ⋮ Randomization Helps Computing a Minimum Spanning Tree under Uncertainty ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Query-competitive sorting with uncertainty ⋮ Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments ⋮ Unnamed Item ⋮ Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty ⋮ An adversarial model for scheduling with testing ⋮ Algorithms for Queryable Uncertainty ⋮ A robust optimization approach with probe-able uncertainty ⋮ Query minimization under stochastic uncertainty ⋮ Query-Competitive Sorting with Uncertainty. ⋮ Randomization Helps Computing a Minimum Spanning Tree under Uncertainty ⋮ Improved online algorithm for fractional knapsack in the random order model ⋮ Explorable uncertainty in scheduling with non-uniform testing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact solution of the robust knapsack problem
• Recoverable robust knapsacks: the discrete scenario case
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust combinatorial optimization with variable budgeted uncertainty
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Robust Convex Optimization
• Introduction to Stochastic Programming
• Recoverable Robust Knapsacks: Γ-Scenarios
• The Price of Robustness
• Computing the Median with Uncertainty
• Information Collection for Linear Programs with Uncertain Objective Coefficients
• On the Robust Knapsack Problem
• Approximation Algorithms for the Weight-Reducible Knapsack Problem
• A First Course in Order Statistics

This page was built for publication: The robust knapsack problem with queries