A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem

DOI10.1016/j.ejor.2009.05.033zbMath1175.90341OpenAlexW2056826275MaRDI QIDQ1039776

Abdelkader Sbihi

Publication date: 23 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.033

zbMATH Keywords

heuristicscombinatorial optimizationrobust optimizationcooperativeknapsackmax-min optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (10)

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 ⋮ Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound ⋮ Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective ⋮ Polynomial-time combinatorial algorithm for general max-min fair allocation ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem ⋮ The binary knapsack problem with qualitative levels

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving knapsack sharing problems with general tradeoff functions
• Multiobjective optimization. Interactive and evolutionary approaches
• An algorithm for the solution of the 0-1 knapsack problem
• Minimax resource allocation problems: Optimization and parametric analysis
• A min-max resource allocation problem with substitutions
• A genetic algorithm for the multidimensional knapsack problem
• A note on the max-min 0-1 knapsack problem
• The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
• A minimal algorithm for the multiple-choice knapsack problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• An efficient algorithm for the knapsack sharing problem
• Constrained matroidal bottleneck problems
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A Max-Min Allocation Problem: Its Solutions and Applications
• An Algorithm for Large Zero-One Knapsack Problems
• Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming
• Linear multiple objective programs with zero–one variables
• A Minimal Algorithm for the 0-1 Knapsack Problem
• On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
• Discrete-Variable Extremum Problems

This page was built for publication: A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem