An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

OR Spectrum

Volumn 20, Issue 1, 1998, Pages 47-53

  Horst, R ^a   Thoai, N V ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Branch and bound algorithm; Integer concave minimization problem; Minimum cost network flow problem

Indexed keywords

EID: 85047671700     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01545530     Document Type: Article

References (14)

1. Ahuja RK, Magnanti TL, Orlin, JB (1993) Network flows. PrenticeHall, New Jersey
2. Bell G, Larnar B, (1996) Solution methods for nonconvex network flow problem. In: Pardalos PM, Hearn D, Hager W (eds) Network optimization. Lecture Notes in Economics and Mathematical Sciences. Springer, Berlin Heidelberg New York
3. Benson HP, Erengue SS, Horst R (1990) A Note on adapting methods for continuous global optimization to the discrete case. Annals of Operations Research 25:243-252
4. Falk IE, Soland RM (1969) An algorithm for separable nonconvex programming problems. Management Science 15: 550-569
5. Guisewite GM (1994) Network Problems. In: Horst R, Pardalos PM (eds) Handbook of global optimization, pp 609-648. Kluwer Academic Publishers, Dordrecht
6. Guisewite GM, Pardalos PM (1990) Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Annals of Operations Research 25:75-100
7. Guisewite GM, Pardalos PM (1991) Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. Journal of Global Optimization 3:245-266
8. Guisewite GM, Pardalos PM (1993) A polynomial time solvable concave network flow problem. Network 23:143-147
9. Horst R, Tuy H (1996) Global optimization: Deterministic approaches, 3rd edn. Springer, Berlin Heidelberg New York
10. Horst R, Thoai NV (1996) A decomposition approach for the global minimization of biconcave functions over polytopes. Journal of Optimization Theory and Applications 88:561-583
11. Klinz B, Tuy H (1993) Minimum concave cost network flow problem with a single nonlinear arc cost. In: Du DZ, Pardalos PM (eds) Network optimization problems. World Scientific, Singapore
12. Lamar BW (1993) A method for solving network flow problems with general nonlinear arc costs. In: Du DZ, Pardalos PM (eds) Network optimization problems. World Scientific, Singapore
13. Soland RM (1974) Optimal facility location with concave costs. Operations Research 22:373-382
14. Thoai, N.V (1994) Global optimization techniques for solving the general quadratic integer programming problem. Research Report, Nr. 9409, University of Trier; forthcoming in: Computational Optimization and Applications