A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.033 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056826275 / rank | |||
Normal rank | |||
Revision as of 03:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem |
scientific article |
Statements
A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (English)
0 references
23 November 2009
0 references
combinatorial optimization
0 references
knapsack
0 references
max-min optimization
0 references
robust optimization
0 references
heuristics
0 references
cooperative
0 references
