The robust knapsack problem with queries

DOI10.1016/J.COR.2014.09.010zbMATH Open1348.90541OpenAlexW2077048701MaRDI QIDQ337391FDOQ337391

Authors: Marc Goerigk, Manoj Gupta, Jonas Ide, 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

Recommendations

• On the robust knapsack problem
• Distributionally robust stochastic knapsack problem
• Exact solution of the robust knapsack problem
• Complexity results and exact algorithms for robust knapsack problems
• Recoverable robust knapsacks: \(\Gamma \)-scenarios

zbMATH Keywords

robust optimizationcompetitivenessqueriesrobust knapsack problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Robust optimization
• The Price of Robustness
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Introduction to stochastic programming.
• A First Course in Order Statistics
• Robust convex optimization
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• Exact solution of the robust knapsack problem
• On the robust knapsack problem
• Robust combinatorial optimization with variable budgeted uncertainty
• Model-driven optimization using adaptive probes
• Title not available (Why is that?)
• Computing the Median with Uncertainty
• Computing minimum spanning trees with uncertainty
• Recoverable robust knapsacks: \(\Gamma \)-scenarios
• Approximation algorithms for the weight-reducible knapsack problem
• Recoverable robust knapsacks: the discrete scenario case
• Information collection for linear programs with uncertain objective coefficients

Cited In (19)

• Scheduling with testing on multiple identical parallel machines
• Query-Competitive Sorting with Uncertainty.
• Algorithms for Queryable Uncertainty
• Scheduling with explorable uncertainty
• Explorable uncertainty in scheduling with non-uniform testing times
• An adversarial model for scheduling with testing
• A robust optimization approach with probe-able 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
• Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
• Query minimization under stochastic uncertainty
• Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
• Complexity results and exact algorithms for robust knapsack problems
• Randomization helps computing a minimum spanning tree under uncertainty
• A note on upper bounds to the robust knapsack problem with discrete scenarios
• Round-competitive algorithms for uncertainty problems with parallel queries
• Improved online algorithm for fractional knapsack in the random order model
• Two-stage robust optimization problems with two-stage uncertainty

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337391)