A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2007.10.045 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2007.10.045 / rank | |||
Normal rank | |||
Latest revision as of 09:06, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles |
scientific article |
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
