On the complexity of the production-transportation problem

SIAM Journal on Optimization

Volumn 6, Issue 1, 1996, Pages 250-264

  Hochbaum, Dorit S ^a   Hong, Sung Pil ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

Concave minimization; Monge sequence; Parametric linear programming; Production transportation problem

Indexed keywords

EID: 0030304778     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/0806014     Document Type: Article

References (11)

1. N. ALON S. COSARES, D. S. HOCHBAUM, AND R. SHAMIR, An algorithm for the detection and construction of Monge sequences, Linear Algebra Appl., 114-115 (1989), pp. 669-680.
2. M. BLUM, R. W. FLOYD, V. R. PRATT, R. L. RIVEST, AND R. E. TARJAN, Time bounds for selection, J. Computer System Sci., 7 (1972), pp. 448-461.
3. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, San Francisco, CA, 1979.
4. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics 2, Springer-Verlag, New York, Berlin, 1988.
5. G. M. GUISEWITE AND P. M. PARDALOS, Minimum concave cost network flow problems: Applications, complexity and algorithms, Ann. Oper. Res., 25 (1990), pp. 75-100.
6. A. J. HOFFMAN, On simple linear programming problems, in Proc. 7th Symposium in Pure Mathematics of the American Mathematical Society, V. Klee, ed., 1963.
7. H. TUY, N. D. DAN, AND S. GHANNADAN, Strongly polynomial time algorithms for certain concave minimization problems on networks, Oper. Res. Lett., 14 (1993), pp. 99-109.
8. H. TUY, S. GHANNADAN, A. MIGDALAS, AND P. VÄARBRAND, Strongly polynomial algorithm for a production-transportation problem with a fixed number of nonlinear variables, Department of Mathematics, Linköping University, preprint, 1993.
9. _, The minimum concave cost network flow problem with a fixed number of sources and nonlinear arc costs, Department of Mathematics, Linköping University, preprint, 1993.
10. K. G. MURTY, Linear Programming, Wiley, New York, 1983.
11. J. B. ORLIN, A faster strongly polynomial minimum cost flow algorithm, Oper. Res., 41 (1993), pp. 338-350.