SHORTEST-ROUTE METHODS .2. GROUP KNAPSACKS, EXPANDED NETWORKS, AND BRANCH-AND-BOUND

被引：12

作者：

DENARDO, EV ^{[1
]}

FOX, BL ^{[1
]}

机构：

[1] UNIV MONTREAL,MONTREAL H3C 3J7,QUEBEC,CANADA

来源：

OPERATIONS RESEARCH | 1979年 / 27卷 / 03期

关键词：

D O I：

10.1287/opre.27.3.548

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：548 / 566

页数：19

相关论文

共 15 条

[1] COMPARISON OF SOME ALGORITHMS FOR SOLVING GROUP THEORETIC INTEGER PROGRAMMING PROBLEM
CHEN, DS
ZIONTS, S
[J]. OPERATIONS RESEARCH, 1976, 24 (06) : 1120 - 1128
[2] SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS
DENARDO, EV
FOX, BL
[J]. OPERATIONS RESEARCH, 1979, 27 (01) : 161 - 186
[3] BRANCHING FROM LARGEST UPPER BOUND FOLKLORE AND FACTS
FOX, BL
LENSTRA, JK
RINNOOYKAN, AHG
SCHRAGE, LE
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1978, 2 (03) : 191 - 194
[4] SHORTEST PATH ALGORITHMS FOR KNAPSACK TYPE PROBLEMS
FRIEZE, AM
[J]. MATHEMATICAL PROGRAMMING, 1976, 11 (02) : 150 - 157
[5] Garfinkel R. S., 1972, INTEGER PROGRAMMING
[6] THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS
GILMORE, PC
GOMORY, RE
[J]. OPERATIONS RESEARCH, 1966, 14 (06) : 1045 - &
[7] INTEGER PROGRAMMING OVER A FINITE ADDITIVE GROUP
GLOVER, F
[J]. SIAM JOURNAL ON CONTROL, 1969, 7 (02): : 213 - &
[8] ON RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
GOMORY, RE
[J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1965, 53 (02) : 260 - &
[9] ADAPTIVE GROUP THEORETIC ALGORITHM FOR INTEGER PROGRAMMING PROBLEMS
GORRY, GA
SHAPIRO, JF
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (05): : 285 - 306
[10] DYNAMIC PROGRAMMING ALGORITHMS FOR INTEGER PROGRAMMING PROBLEM .I. INTEGER PROGRAMMING PROBLEM VIEWED AS A KNAPSACK TYPE PROBLEM
SHAPIRO, JF
[J]. OPERATIONS RESEARCH, 1968, 16 (01) : 103 - &