APPROXIMATE ALGORITHMS FOR THE DISCRETE NETWORK DESIGN PROBLEM

被引：103

作者：

POORZAHEDY, H

TURNQUIST, MA

机构：

[1] NORTHWESTERN UNIV, EVANSTON, IL 60201 USA

[2] CORNELL UNIV, SCH CIVIL & ENVIRONM ENGN, ITHACA, NY 14853 USA

来源：

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | 1982年 / 16卷 / 01期

关键词：

D O I：

10.1016/0191-2615(82)90040-6

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

引用

页码：45 / 55

页数：11

共 12 条

[1] CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS [J].

ABDULAAL, M ;

LEBLANC, LJ .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) :19-32

[2] OPTIMAL NETWORK PROBLEM - BRANCH-AND-BOUND ALGORITHM [J].

BOYCE, DE ;

FARHI, A ;

WEISCHEDEL, R .

ENVIRONMENT AND PLANNING A, 1973, 5 (04) :519-533

[3] TRAFFIC ASSIGNMENT PROBLEM FOR A GENERAL NETWORK [J].

DAFERMOS, SC ;

SPARROW, FT .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1969, B 73 (02) :91-+

[4] FORMULATING AND SOLVING THE NETWORK DESIGN PROBLEM BY DECOMPOSITION [J].

DANTZIG, GB ;

HARVEY, RP ;

LANSDOWNE, ZF ;

ROBINSON, DW ;

MAIER, SF .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1979, 13 (01) :5-17

[5]

Frank M., 1956, NAV RES LOG, V3, P95, DOI 10.1002/nav.3800030109

[6]

Leblanc L. J., 1975, Transportation Science, V9, P183, DOI 10.1287/trsc.9.3.183

[7] EFFICIENT APPROACH TO SOLVING ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM [J].

LEBLANC, LJ ;

MORLOK, EK ;

PIERSKALLA, WP .

TRANSPORTATION RESEARCH, 1975, 9 (05) :309-318

[8] BRAESSS PARADOX OF TRAFFIC FLOW [J].

MURCHLAND, JD .

TRANSPORTATION RESEARCH, 1970, 4 (04) :391-+

[9]

OCHOAROSSO F, 1968, MITR6844 DEP CIV ENG

[10]

POORZAHEDY H, 1980, THESIS NW U EVANSTON

← 1 2 →