A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741): 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/bf02614365 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3139172074 / rank | |||
Normal rank | |||
Latest revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time primal network simplex algorithm for minimum cost flows |
scientific article |
Statements
A polynomial time primal network simplex algorithm for minimum cost flows (English)
0 references
25 November 1997
0 references
polynomial time primal network simplex algorithm
0 references
mininium cost flow
0 references
0 references
0 references
0 references
0 references
0 references
