A Strongly Polynomial Algorithm for a Special Class of Linear Programs (Q4006338): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.39.6.955 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039394406 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.39.6.955 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:31, 28 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Strongly Polynomial Algorithm for a Special Class of Linear Programs |
scientific article |
Statements
A Strongly Polynomial Algorithm for a Special Class of Linear Programs (English)
0 references
26 September 1992
0 references
strongly polynomial time
0 references
generalized transshipment
0 references
Leontief substitution systems
0 references
