A COMPOSITE ALGORITHM FOR A CONCAVE-COST NETWORK FLOW PROBLEM

[1] Balakrishnan A, 1984, THESIS MIT

[2] CROWDER HP, 1976, S MATH, V19, P357

[3] Dijkstra E. W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[4] SEND-AND-SPLIT METHOD FOR MINIMUM-CONCAVE-COST NETWORK FLOWS [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (04) : 634 - 664

[5] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J]. MANAGEMENT SCIENCE, 1981, 27 (01) : 1 - 18

[6] CONCAVE COST MINIMIZATION ON NETWORKS [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1979, 3 (03) : 239 - 249

[7] Geoffrion A.M., 1974, MATHEMATICAL PROGRAM, P82, DOI DOI 10.1007/BFB0120690

[8] COMPLEXITY OF NETWORK DESIGN PROBLEM [J]. NETWORKS, 1978, 8 (04) : 279 - 285

[9] LAMAR B, 1983, CTSIU832 CTR TRANSP

[10] LAMAR BW, 1984, BOUNDING PROCEDURES

[1] Balakrishnan A, 1984, THESIS MIT

[2] CROWDER HP, 1976, S MATH, V19, P357

[3] Dijkstra E. W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[4] SEND-AND-SPLIT METHOD FOR MINIMUM-CONCAVE-COST NETWORK FLOWS [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (04) : 634 - 664

[5] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J]. MANAGEMENT SCIENCE, 1981, 27 (01) : 1 - 18

[6] CONCAVE COST MINIMIZATION ON NETWORKS [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1979, 3 (03) : 239 - 249

[7] Geoffrion A.M., 1974, MATHEMATICAL PROGRAM, P82, DOI DOI 10.1007/BFB0120690

[8] COMPLEXITY OF NETWORK DESIGN PROBLEM [J]. NETWORKS, 1978, 8 (04) : 279 - 285

[9] LAMAR B, 1983, CTSIU832 CTR TRANSP

[10] LAMAR BW, 1984, BOUNDING PROCEDURES