SURROGATE DUALITY IN A BRANCH-AND-BOUND PROCEDURE

被引：10

作者：

KARWAN, MH ^{[1
]}

RARDIN, RL ^{[1
]}

机构：

[1] GEORGIA INST TECHNOL,SCH IND & SYST ENGN,ATLANTA,GA 30332

来源：

关键词：

D O I：

10.1002/nav.3800280107

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：93 / 101

页数：9

共 7 条

[1] AN ENUMERATION ALGORITHM FOR KNAPSACK PROBLEMS
CABOT, AV
[J]. OPERATIONS RESEARCH, 1970, 18 (02) : 306 - &
[2] RESOLUTION OF 0-1 KNAPSACK PROBLEM - COMPARISON OF METHODS
FAYARD, D
PLATEAU, G
[J]. MATHEMATICAL PROGRAMMING, 1975, 8 (03) : 272 - 307
[3] Garfinkel R. S., 1972, INTEGER PROGRAMMING
[4] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM
GREENBERG, H
HEGERICH, RL
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05): : 327 - 332
[5] Karwan M.H., 1976, THESIS GEORGIA I TEC
[6] KARWAN MH, 1976, J7713 GEORG I TECHN
[7] [No title captured]