A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles |
scientific article; zbMATH DE number 5318696
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles |
scientific article; zbMATH DE number 5318696 |
Statements
A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (English)
0 references
1 September 2008
0 references
0-1 multi-constrained knapsack problem
0 references
heuristic
0 references
computational complexity
0 references
NP-hard problems
0 references
numerical examples
0 references
0 references
