Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280)
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: Solution methods and computational investigations for the linear bottleneck assignment problem |
scientific article; zbMATH DE number 1112333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution methods and computational investigations for the linear bottleneck assignment problem |
scientific article; zbMATH DE number 1112333 |
Statements
Solution methods and computational investigations for the linear bottleneck assignment problem (English)
0 references
4 February 1998
0 references
linear bottleneck assignment problem
0 references
maximum cardinality matching
0 references
sparse subgraphs
0 references
0 references
0 references
0.90565455
0 references
0.89833856
0 references
0.89833856
0 references
0.8941599
0 references
0.89260244
0 references
0.8868652
0 references
0 references
0.8843688
0 references
