A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
type: Item
instance of: scholarly article
title: A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
zbMATH Open document ID: 1175.90341
author: Abdelkader Sbihi
published in: European Journal of Operational Research
publication date: 2009-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5637059
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: knapsack
zbMATH Keywords: max-min optimization
zbMATH Keywords: robust optimization
zbMATH Keywords: heuristics
zbMATH Keywords: cooperative
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.05.033
OpenAlex ID: W2056826275
cites work: Constrained matroidal bottleneck problems
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Linear multiple objective programs with zero–one variables
cites work: Multiobjective optimization. Interactive and evolutionary approaches
cites work: Solving knapsack sharing problems with general tradeoff functions
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: Discrete-Variable Extremum Problems
cites work: Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
cites work: Q4198056
cites work: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
cites work: An efficient algorithm for the knapsack sharing problem
cites work: A note on the max-min 0-1 knapsack problem
cites work: Minimax resource allocation problems: Optimization and parametric analysis
cites work: Q3993418
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
cites work: A min-max resource allocation problem with substitutions
cites work: A minimal algorithm for the multiple-choice knapsack problem
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
cites work: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
cites work: Q3815146
cites work: A Max-Min Allocation Problem: Its Solutions and Applications
cites work: Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
DOI: 10.1016/J.EJOR.2009.05.033
description: scientific article; zbMATH DE number 5637059