On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
From MaRDI portal
Publication:4888190
DOI10.1287/opre.44.2.407zbMath0855.90086MaRDI QIDQ4888190
Publication date: 28 October 1996
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.44.2.407
90C09: Boolean programming
Related Items
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems, Recoverable robust knapsacks: the discrete scenario case, Robust optimization for performance tuning of modern database systems, Combinatorial optimization problems in wireless switch design, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Choosing robust solutions in discrete optimization problems with fuzzy costs, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, Min-max optimization of several classical discrete optimization problems, Robust economic order quantity models, On the robust shortest path problem., An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem, Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria, A randomized algorithm for the min-Max selecting items problem with uncertain weights, Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem, Hybrid approaches for the two-scenario max-min knapsack problem, The lexicographic α-robust knapsack problem, A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
