Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources (Q4294732): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.19.1.94 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972029377 / rank | |||
Normal rank | |||
Latest revision as of 20:08, 19 March 2024
scientific article; zbMATH DE number 569323
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources |
scientific article; zbMATH DE number 569323 |
Statements
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources (English)
0 references
12 December 1994
0 references
transportation problem
0 references
convex nonquadratic objective function
0 references
strongly polynomial time
0 references
