Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873)
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: Upper and lower bounding procedures for the multiple knapsack assignment problem |
scientific article; zbMATH DE number 6396950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper and lower bounding procedures for the multiple knapsack assignment problem |
scientific article; zbMATH DE number 6396950 |
Statements
Upper and lower bounding procedures for the multiple knapsack assignment problem (English)
0 references
4 February 2015
0 references
combinatorial optimization
0 references
heuristics
0 references
multiple knapsack problem
0 references
assignment problem
0 references
Lagrangian relaxation
0 references
0 references
0.8494222164154053
0 references
0.8494222164154053
0 references
0.8270779252052307
0 references
0.8109762668609619
0 references
0.8086206316947937
0 references
