LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573)
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: LP based heuristics for the multiple knapsack problem with assignment restrictions |
scientific article; zbMATH DE number 5122243
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LP based heuristics for the multiple knapsack problem with assignment restrictions |
scientific article; zbMATH DE number 5122243 |
Statements
LP based heuristics for the multiple knapsack problem with assignment restrictions (English)
0 references
5 February 2007
0 references
multiple knapsack problem
0 references
randomized rounding
0 references
traffic routing
0 references
0 references
0.8436539769172668
0 references
0.8436539769172668
0 references
0.789015531539917
0 references
0.7758544683456421
0 references
0.766718327999115
0 references
