An algorithm for the planar three-index assignment problem (Q1333481)
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: An algorithm for the planar three-index assignment problem |
scientific article; zbMATH DE number 639296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for the planar three-index assignment problem |
scientific article; zbMATH DE number 639296 |
Statements
An algorithm for the planar three-index assignment problem (English)
0 references
15 September 1994
0 references
branch-and-bound
0 references
planar three-index assignment
0 references
Latin square structure
0 references
Lagrangean relaxation scheme
0 references
subgradient optimization
0 references
0 references
0.9067891240119934
0 references
0.8386155962944031
0 references
0.8296779990196228
0 references
0.8269475698471069
0 references
0.8231463432312012
0 references
