Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks (Q3115274)
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: Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks |
scientific article; zbMATH DE number 6007908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks |
scientific article; zbMATH DE number 6007908 |
Statements
20 February 2012
0 references
quadratic bottleneck assignment problem
0 references
location problem
0 references
polynomial algorithm
0 references
graph
0 references
0.8877134323120117
0 references
0.7970665097236633
0 references
0.7869846224784851
0 references
0.7789691686630249
0 references
