A BRANCH AND BOUND ALGORITHM FOR THE ACYCLIC SUBGRAPH PROBLEM

被引：18

作者：

KAAS, R

机构：

来源：

关键词：

D O I：

10.1016/0377-2217(81)90005-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：355 / 362

页数：8

共 20 条

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2] [Anonymous], 1979, OPTIMISATION ANAL OR
[3] *CENTR BUR STAT, 1974, PROD NED VOLKSH, V6
[4] Dantzig G., 1951, ACTIVITY ANAL PRODUC, P339
[5] MAXIMUM LIKELIHOOD PAIRED COMPARISON RANKING BY LINEAR PROGRAMMING
DECANI, JS
[J]. BIOMETRIKA, 1969, 56 (03) : 537 - &
[6] DECANI JS, 1972, BIOMETRIKA, V59, P131
[7] BRANCH SEARCH ALGORITHM FOR MAXIMUM LIKELIHOOD PAIRED COMPARISON RANKING
FLUECK, JA
KORSH, JF
[J]. BIOMETRIKA, 1974, 61 (03) : 621 - 626
[8] Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]
[9] GILMORE P, 1962, J SOC IND APPL MATH, V10
[10] HELMSTADTER E, 1957, JB NATIONALOKONOMIE, V169, P173