Equivalence of the primal and dual simplex algorithms for the maximum flow problem (Q1362513): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3056948 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strongly polynomial dual simplex methods for the maximum flow problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Use of dynamic trees in a network simplex algorithm for the maximum flow problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem / rank | |||
Normal rank | |||
Latest revision as of 17:57, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of the primal and dual simplex algorithms for the maximum flow problem |
scientific article |
Statements
Equivalence of the primal and dual simplex algorithms for the maximum flow problem (English)
0 references
5 August 1997
0 references
primal and dual simplex algorithms
0 references
maximum flow
0 references
0 references
