Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem (Q3829355)
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: Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem |
scientific article; zbMATH DE number 4104716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem |
scientific article; zbMATH DE number 4104716 |
Statements
Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem (English)
0 references
1989
0 references
generalized assignment
0 references
minimum cost assignment
0 references
Lagrangian dual ascent
0 references
surrogate constraint
0 references
branch-and-bound
0 references
0.9051958918571472
0 references
0.8801677227020264
0 references
0.87724769115448
0 references
0.8681647777557373
0 references
