Efficient dual simplex algorithms for the assignment problem (Q3701192)
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: Efficient dual simplex algorithms for the assignment problem |
scientific article; zbMATH DE number 3926627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient dual simplex algorithms for the assignment problem |
scientific article; zbMATH DE number 3926627 |
Statements
Efficient dual simplex algorithms for the assignment problem (English)
0 references
1985
0 references
weighted matching
0 references
block-pivot
0 references
assignment problem
0 references
dual simplex method
0 references
implementation analysis
0 references
0.896759569644928
0 references
0.8728402853012085
0 references
0.8693182468414307
0 references
0.8655067682266235
0 references
