A competitive (dual) simplex method for the assignment problem (Q3730345)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3961343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A competitive (dual) simplex method for the assignment problem |
scientific article; zbMATH DE number 3961343 |
Statements
A competitive (dual) simplex method for the assignment problem (English)
0 references
1986
0 references
signature
0 references
worst case complexity
0 references
simplex method
0 references
linear assignment
0 references
new pivot choice rules
0 references
dual simplex method
0 references
average number of pivots
0 references
0.8728402853012085
0 references
0.8499048948287964
0 references
0.84959477186203
0 references
0.8456276059150696
0 references
0.8214536309242249
0 references
