Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case (Q1595283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1563625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case |
scientific article; zbMATH DE number 1563625 |
Statements
Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case (English)
0 references
4 October 2001
0 references
multi-objective programming
0 references
knapsack problem
0 references
tabu search
0 references
decision space reduction
0 references
0.9233073
0 references
0.9181466
0 references
0 references
0.8900216
0 references
0.88722587
0 references
0.88505465
0 references
0.87905234
0 references
0.87604696
0 references
