Article ID: | iaor19941865 |
Country: | United States |
Volume: | 19 |
Issue: | 1 |
Start Page Number: | 94 |
End Page Number: | 111 |
Publication Date: | Feb 1994 |
Journal: | Mathematics of Operations Research |
Authors: | Hochbaum Dorit S., Cosares Steven |
Keywords: | programming: transportation, transportation: general |
The Transportation problem with a linear objective function is known to be solvable in strongly polynomial time, whereas instances with a convex nonquadratic objective function are not even for cases with the integrality constraints relaxed. The authors present a linear time algorithm for the Continuous Quadratic Transportation problem with two source nodes. Further, they show how problem instances with a fixed number of source (or destination) nodes,