On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
From MaRDI portal
Recommendations
- 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
- Complexity results and exact algorithms for robust knapsack problems
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
Cited in
(35)- 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.
- 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
- An application of the multiple knapsack problem: the self-sufficient marine
- An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Complexity results and exact algorithms for robust knapsack problems
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- A randomized algorithm for the min-Max selecting items problem with uncertain weights
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- Robust optimization approach for a chance-constrained binary knapsack problem
- Hybrid approaches for the two-scenario max-min knapsack problem
- The lexicographic \(\alpha \)-robust knapsack problem
- Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- The applications of 0-1 knapsack problem in limit investment decision and its recovery from disruption
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- scientific article; zbMATH DE number 2156314 (Why is no real title available?)
- Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
- Packing a knapsack of unknown capacity
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Recoverable robust knapsacks: the discrete scenario case
- Robust optimization for performance tuning of modern database systems
- Combinatorial optimization problems in wireless switch design
This page was built for publication: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888190)
