A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems

Journal of Global Optimization

Volumn 18, Issue 1, 2000, Pages 59-73

  Kuno, Takahito ^a   Utsunomiya, Takahiro ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Branch and bound algorithm; Global optimization; Lagrangian relaxation; Minimum concave cost flow problem; Production transportation problem

Indexed keywords

EID: 0348003083     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008373329033     Document Type: Article

References (25)

1. Aho, A.V., Hopcroft, J.E. and Ullman, J.D. (1983), Data Structures and Algorithms, Addison-Wesley, M.A.
2. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993), Network Flows: Theory, Algorithms and Applications, Prentice Hall, N.J.
3. Bazaraa, M.S., Sherali, H.D. and Shetty, C.M. (1993), Nonlinear Programming: Theory and Algorithms, 2nd ed. John Wiley and Sons, N.Y.
4. Falk, J.E. and Soland, R.M. (1969), An algorithm for separable nonconvex programming problems, Management Science 15: 550-569.
5. Gallo, G., Sandi, C. and Sodini, C. (1980), An algorithm for the min concave cost flow problem, European Journal of Operational Research 4: 248-255.
6. Ghannadan, S., Migdalas, A., Tuy, H. and Värbrand, P. (1994), Heuristics based on tabu search and Lagrangean relaxation for the concave production-transportation problem, Studies in Regional and Urban Planning 3: 127-140.
7. Guisewite, G.M. (1995), Network problems, in Horst, R. and Pardalos, P.M. (eds.), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht.
8. Guisewite, G.M. and Pardalos, P.M. (1991), Global search algorithms for minimum concave-cost network flow problems, Journal of Global Optimization, 1: 309-330.
9. Guisewite, G.M. and Pardalos, P.M. (1993), A polynomial time solvable concave network flow problem, Networks 23: 143-149.
10. Holmberg, K. and Tuy, H. (1999), A production-transportation problem with stochastic demand and concave production costs, Mathematical Programming 85: 157-179.
11. Horst, R., Pardalos, P.M. and Thoai, N.V. (1995), Introduction to Global Optimization, Kluwer Academic Publishers, Dordrecht.
12. Horst, R. and Tuy, H. (1993), Global Optimization: Deterministic Approaches, 2nd edn. Springer-Verlag, Berlin.
13. Klinz, B. and Tuy, H. (1993), Minimum concave-cost network flow problems with a single nonlinear arc cost, in Dungzhu Du and Pardalos, P.M. (eds.), Network Optimization Problems, World Scientific, Singapore, pp. 125-143.
14. Konno, H., Thach, P.T. and Tuy, H. (1997), Optimization on Low Rank Nonconvex Structures, Kluwer Academic Publishers, Dordrecht.
15. Kuno, T. and Utsunomiya, T. (1996), A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost, Journal of Global Optimization 8: 67-80.
16. Kuno, T. and Utsunomiya, T. (1997), A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem, Journal of Global Optimization 11: 163-180.
17. Kuno, T. (1997), A pseudo-polynomial algorithm for solving rank three concave production-transportation problems, Acta Mathematica Vietnamica 22: 159-182.
18. Magnanti, T.L. and Wong, R.T. (1984), Network design and transportation planning: models and algorithms, Transportation Science 18: 1-55.
19. Nemhauser, G.L. and Wolsey, L.A. (1988), Integer and Combinatorial Optimization, John Wiley and Sons, N.Y.
20. Soland, R.M. (1974), Optimal facility location problems with concave costs, Operations Research 22: 373-382.
21. Tuy, H. (1991), Polyhedral annexation, dualization and dimension reduction technique in global optimization, Journal of Global Optimization 1: 229-244.
22. Tuy, H. (1998), Convex Analysis and Global Optimization, Kluwer Academic Publishers, Dordrecht.
23. Tuy, H., Dan, N.D. and Ghannadan, S. (1993), Strongly polynomial time algorithms for certain concave minimization problems on networks, Operations Research Letters 14: 99-109.
24. Tuy, H., Ghannadan, S., Migdalas, A. and Värbrand, P. (1993), Strongly polynomial algorithm for a production-transportation problem with concave production cost, Optimization 27: 205-227.
25. Tuy, H., Ghannadan, S., Migdalas, A. and Värbrand, P. (1996), Strongly polynomial algorithm for a production-transportation problem with a fixed number of nonlinear variables, Mathematical Programming 72: 229-258.