On the complexity of the continuous unbounded knapsack problem with uncertain coefficients

DOI10.1016/j.orl.2004.11.003zbMath1195.90075OpenAlexW2007637529MaRDI QIDQ2488199

Eduardo Conde

Publication date: 25 August 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.11.003

zbMATH Keywords

ComplexityPolynomial algorithmMinmax regret optimization

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (6)

Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ Minmax regret bottleneck problems with solution-induced interval uncertainty structure ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty

Cites Work

• Unnamed Item
• Hyperbolic 0-1 programming and query optimization in information retrieval
• Minmax regret linear resource allocation problems.
• An Algorithm for Large Zero-One Knapsack Problems

This page was built for publication: On the complexity of the continuous unbounded knapsack problem with uncertain coefficients