A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem (Q2784114)
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 Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem |
scientific article; zbMATH DE number 1731110
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem |
scientific article; zbMATH DE number 1731110 |
Statements
17 April 2002
0 references
generalized multi-assignment problem
0 references
generalized assignment problem
0 references
Lagrangian dual ascent
0 references
subgradient search
0 references
Lagrangian dual-based branch-and-bound
0 references
A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem (English)
0 references
