OPTIMAL NETWORK PROBLEM - BRANCH-AND-BOUND ALGORITHM

被引：55

作者：

BOYCE, DE

FARHI, A

WEISCHEDEL, R

机构：

[1] UNIV PENN, REG SCI DEPT, PHILADELPHIA, PA 19104 USA

[2] SESAME, 48 BLVD LATOUR MAUBOURG, 75 PARIS, FRANCE

[3] UNIV PENN, MOORE SCH ELECT ENGN, PHILADELPHIA, PA 19104 USA

来源：

关键词：

D O I：

10.1068/a050519

中图分类号：

X [环境科学、安全科学];

学科分类号：

08 ; 0830 ;

摘要：

引用

页码：519 / 533

页数：15

共 21 条

[1] Agin N., 1966, MANAGE SCI, V13, pB176
[2] BEALE EML, 1967, BIOMETRIKA, V54, P357
[3] BEALE EML, 1970, INTEGER NONLINEAR PR
[4] BECKMANN MJ, 1967, QUANTITATIVE GEOGR 1
[5] TRAVELING SALESMAN PROBLEM - A SURVEY
BELLMORE, M
NEHAUSE.GL
[J]. OPERATIONS RESEARCH, 1968, 16 (03) : 538 - &
[6] Berge C., 1965, PROGRAMMING GAMES TR
[7] BOYCE DE, 1972, RESEAUX TRANSPORT OP
[8] GRONINGER KL, 1971, THESIS CORNELL U
[9] Halder A. K., 1970, TRANSPORT SCI, V4, P36
[10] BRANCH-AND-BOUND METHODS - A SURVEY
LAWLER, EL
WOOD, DE
[J]. OPERATIONS RESEARCH, 1966, 14 (04) : 699 - +