A competitive (dual) simplex method for the assignment problem (Q3730345): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01580579 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047029951 / rank | |||
Normal rank | |||
Latest revision as of 09:11, 30 July 2024
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
