On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
From MaRDI portal
Publication:4888190
DOI10.1287/opre.44.2.407zbMath0855.90086OpenAlexW2076163541MaRDI 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
Related Items (26)
Packing a Knapsack of Unknown Capacity ⋮ Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound ⋮ Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria ⋮ Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem ⋮ On the robust shortest path problem. ⋮ General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems ⋮ Combinatorial optimization problems in wireless switch design ⋮ Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ Recoverable robust knapsacks: the discrete scenario case ⋮ An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem ⋮ A randomized algorithm for the min-Max selecting items problem with uncertain weights ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem ⋮ Min-max optimization of several classical discrete optimization problems ⋮ The lexicographic α-robust knapsack problem ⋮ Robust economic order quantity models ⋮ Choosing robust solutions in discrete optimization problems with fuzzy costs ⋮ A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem ⋮ Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem ⋮ Robust optimization for performance tuning of modern database systems
This page was built for publication: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
