Solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

Operations Research Letters

Volumn 24, Issue 4, 1999, Pages 195-203

  Kim, Dukwon ^a   Pardalos, Panos M ^a  

^a 303 W ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; CRITICAL PATH ANALYSIS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

DYNAMIC SLOPE SCALING METHOD; FIXED CHARGE NETWORK FLOW PROBLEMS;

OPERATIONS RESEARCH;

EID: 0032640670     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00004-8     Document Type: Article

References (23)

1. Balinski M.L. Fixed cost transportation problem. Nav. Res. Logistics Q. 8:1961;41-54.
2. Barr R.S., Glover F., Klingman D. A new optimization method for large scale fixed charge transportation problems. Oper. Res. 29:1981;448-463.
3. G.J. Bell, B.W. Lamar, C.A. Wallace, Capacity improvement, penalties, and the fixed charge transportation problem, Research Paper, Department of Management, Univ. of Canterbury, Christchurch, New Zealand, 1996.
4. Cabot A.V., Erenguc S.S. Some branch-and-bound procedures for fixed-cost transportation problems. Nav. Res. Logistics Q. 31:1984;145-154.
5. Cooper L., Drebes C. An approximate solution method for the fixed charge problem. Nav. Res. Logistics Q. 14:1967;101-113.
6. Denzler D.R. An approximate algorithm for the fixed charge problem. Nav. Res. Logistics Q. 16:1964;411-416.
7. Diaby M. Successive linear approximation procedure for generalized fixed-charge transportation problem. J. Oper. Res. Soc. 42:1991;991-1001.
8. Gray P. Exact solution of the fixed-charge transportation problem. Oper. Res. 19:1971;1529-1538.
9. Guisewite G.M., Pardalos P.M. Minimum concave-cost network flow problems. Ann. Oper. Res. 25:1990;75-100.
10. Hirsch W.M., Dantzig G.B. The fixed charge problem. Nav. Res. Logistics Q. 15:1968;413-424.
11. R. Horst, P.M. Pardalos (Eds.), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, 1995.
12. Kennington J., Unger V.E. A new branch-and-bound algorithm for the fixed charge transportation problem. Manage. Sci. 22:1976;1116-1126.
13. Khang D.B., Fujiwara O. Approximate solution of capacitated fixed-charge minimum cost network flow problems. Networks. 21:1991;689-704.
14. Kuhn H., Baumol W. An approximate algorithm for the fixed charge transportation problem. Nav. Res. Logistics Q. 9:1962;1-15.
15. B.W. Lamar, C.A. Wallace, Revised-modified penalties for fixed charge transportation problems, Manage. Sci., 1999, forthcoming.
16. Murty K.G. Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16:1968;268-279.
17. K.G. Murty, Linear and Combinatorial Programming, Wiley, New York, 1976.
18. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
19. Palekar U.S., Karwan M.H., Zionts S. A branch-and-bound method for fixed charge transportation problem. Manage. Sci. 36:1990;1092-1105.
20. P.M. Pardalos, J.B. Rosen, Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science, vol. 268, Springer, Berlin, 1987.
21. Steinberg D.I. The fixed charge problem. Nav. Res. Logistics Q. 17:1970;217-236.
22. Walker W.E. A adjacent extreme point algorithm for the fixed charge problem. Manage. Sci. 22:1976;587-596.
23. Yaged B. Minimum cost routing for static network models. Networks. 1:1971;139-172.