OPTIMAL TIME-VARYING FLOWS ON CONGESTED NETWORKS

[1] Bazaraa MS, 1979, NONLINEAR PROGRAMMIN

[2] Beckmann M., 1956, STUDIES EC TRANSPORT

[3] CAREY M, 1980, CONVEX DYNAMIC ASSIG

[4] CAREY M, 1980, WELL BEHAVED LINEAR

[5] CAREY M, 1984, UNPUB OPTIMAL TIME V

[6] CARNEY M, 1982, MODELING NETWORK FLO

[7] D'ans G. C., 1976, Transportation Science, V10, P1, DOI 10.1287/trsc.10.1.1

[8] TRAFFIC ASSIGNMENT PROBLEM FOR A GENERAL NETWORK [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1969, B 73 (02): : 91 - +

[9] FORMULATING AND SOLVING THE NETWORK DESIGN PROBLEM BY DECOMPOSITION [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) : 5 - 17

[10] FLORIAN M, 1984, TRANSPORTATION PLANN, P137

[1] Bazaraa MS, 1979, NONLINEAR PROGRAMMIN

[2] Beckmann M., 1956, STUDIES EC TRANSPORT

[3] CAREY M, 1980, CONVEX DYNAMIC ASSIG

[4] CAREY M, 1980, WELL BEHAVED LINEAR

[5] CAREY M, 1984, UNPUB OPTIMAL TIME V

[6] CARNEY M, 1982, MODELING NETWORK FLO

[7] D'ans G. C., 1976, Transportation Science, V10, P1, DOI 10.1287/trsc.10.1.1

[8] TRAFFIC ASSIGNMENT PROBLEM FOR A GENERAL NETWORK [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1969, B 73 (02): : 91 - +

[9] FORMULATING AND SOLVING THE NETWORK DESIGN PROBLEM BY DECOMPOSITION [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) : 5 - 17

[10] FLORIAN M, 1984, TRANSPORTATION PLANN, P137