Adaptive dynamic cost updating procedure for solving fixed charge network flow problems

Computational Optimization and Applications

Volumn 39, Issue 1, 2008, Pages 37-50

  Nahapetyan, Artyom ^a   Pardalos, Panos ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Concave piecewise linear network flow problem; Fixed charge network flow problem; Logistics; Supply chain

Indexed keywords

APPROXIMATION ALGORITHMS; HEURISTIC ALGORITHMS; NUMERICAL METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING;

DYNAMIC COST UPDATING PROCEDURE; FIXED CHARGE NETWORK FLOW PROBLEM; LINEAR NETWORK FLOW PROBLEM;

COSTS;

EID: 37649022205     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9060-x     Document Type: Article

References (16)

1. Barr, R., Glover, F., Klingman, D.: A new optimization method for large scale fixed charge transportation problems. Oper. Res. 29, 448-463 (1981)
2. Cabot, A., Erenguc, S.: Some branch-and-bound procedures for fixed-cost transportation problems. Nav. Res. Log. Q. 31, 145-154 (1984)
3. Cooper, L., Drebes, C.: An approximate solution method for the fixed charge problem. Nav. Res. Log. Q. 14, 101-113 (1967)
4. Diaby, M.: Successive linear approximation procedure for generalized fixed-charge transportation problem. J. Oper. Res. Soc. 42, 991-1001 (1991)
5. Geunes, J., Pardalos, P.: Supply Chain Optimization. Springer, Berlin (2005)
6. Gray, P.: Exact solution for the fixed-charge transportation problem. Oper. Res. 19, 1529-1538 (1971)
7. Guisewite, G., Pardalos, P.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25, 75-100 (1990)
8. Hirsch, W., Dantzig, G.: The fixed charge problem. Nav. Res. Log. Q. 15, 413-424 (1968)
9. Kennington, J., Unger, V.: A new branch-and-bound algorithm for the fixed charge transportation problem. Manag. Sci. 22, 1116-1126 (1976)
10. Khang, D., Fujiwara, O.: Approximate solution of capacitated fixed-charge minimum cost network flow problems. Networks 21, 689-704 (1991)
11. Kim, D., Pardalos, P.: A solution approach to the fixed charged network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 195-203 (1999)
12. Kim, D., Pardalos, P.: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. Networks 35(3), 216-222 (2000)
13. Kuhn, H., Baumol, W.: An approximate algorithm for the fixed charge transportation problem. Nav. Res. Log. Q. 9, 1-15 (1962)
14. Murty, K.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16, 268-279 (1968)
15. Nahapetyan, A., Pardalos, P.: A bilinear relaxation based algorithm for concave piecewise linear network flow problems. J. Ind. Manag. Optim. 3, 71-85 (2007)
16. Palekar, U., Karwan, M., Zionts, S.: A branch-and-bound method for fixed charge transportation problem. Manag. Sci. 36, 1092-1105 (1990)