Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources (Q4294732)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources |
scientific article; zbMATH DE number 569323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8345075249671936
0 references
0.8202081918716431
0 references
0.7980303168296814
0 references
0.7897125482559204
0 references
