On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
From MaRDI portal
Publication:2488199
DOI10.1016/j.orl.2004.11.003zbMath1195.90075MaRDI QIDQ2488199
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
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty, Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization 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, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, Complexity results and exact algorithms for robust knapsack problems
Cites Work