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 this page instead for the normal view: A competitive (dual) simplex method for the assignment problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A competitive (dual) simplex method for the assignment problem |
scientific article |
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
