A network simplex method (Q4123079): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q5808754 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3236245 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3292914 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theorem on flows in networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycling in the transportation problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Transhipment Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A bad network problem for the simplex method and other minimum cost flow algorithms / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01580379 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056178482 / rank | |||
Normal rank |
Latest revision as of 09:33, 30 July 2024
scientific article; zbMATH DE number 3548724
Language | Label | Description | Also known as |
---|---|---|---|
English | A network simplex method |
scientific article; zbMATH DE number 3548724 |
Statements
A network simplex method (English)
0 references
1976
0 references