A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416)
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 428260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A genuinely polynomial primal simplex algorithm for the assignment problem |
scientific article; zbMATH DE number 428260 |
Statements
A genuinely polynomial primal simplex algorithm for the assignment problem (English)
0 references
6 December 1993
0 references
The author presents a primal simplex algorithm that solves the assignment problem in \(O(n^ 2)\) pivot operations. The algorithm works with an increasing sequence of subgraphs. A feasible basis corresponds to a strongly feasible tree. Degeneration is dealt with Dantzig's rule. The total number of consecutive degenerate pivots is bounded by \({1\over 2}(n+ 2)(n- 1)\). The total number of nondegenerate pivots is bounded by \(n-1\). An update of the basis and dual variables can be performed in \(O(n)\) operations. The paper contains a short characterization of other primal or dual simplex algorithms for the assignment problem.
0 references
network simplex method
0 references
polynomial algorithms
0 references
primal simplex algorithm
0 references
assignment problem
0 references
increasing sequence of subgraphs
0 references
0 references
0 references
0 references
0.8655067682266235
0 references
0.8550931811332703
0 references
0.8456276059150696
0 references
0.8361905813217163
0 references
