A HEURISTIC WITH TIE BREAKING FOR CERTAIN 0-1 INTEGER PROGRAMMING-MODELS

被引:13
作者
FOX, GE
SCUDDER, GD
机构
关键词
D O I
10.1002/nav.3800320408
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:613 / 623
页数:11
相关论文
共 10 条
[1]  
BALAS E, 1979, COMBINATORIAL OPTIMI
[2]  
DOBSON G, 1982, MATH OPER RES, V4, P515
[3]   WORST-CASE ANALYSIS OF HEURISTIC ALGORITHMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1980, 26 (01) :1-17
[4]   EFFICIENT HEURISTIC ALGORITHMS FOR POSITIVE 0-1 POLYNOMIAL PROGRAMMING-PROBLEMS [J].
GRANOT, F .
MANAGEMENT SCIENCE, 1982, 28 (07) :829-836
[5]  
Kochenberger G.A., 1974, DECISION SCI, V5, P36
[7]  
SENJU S, 1968, MANAGE SCI, V15, pB196
[8]   SIMPLIFIED ALGORITHM FOR OBTAINING APPROXIMATE SOLUTIONS TO ZERO-ONE PROGRAMMING PROBLEMS [J].
TOYODA, Y .
MANAGEMENT SCIENCE SERIES B-APPLICATION, 1975, 21 (12) :1417-1427
[9]   AN EFFICIENT HEURISTIC FOR LARGE SET COVERING PROBLEMS [J].
VASKO, FJ ;
WILSON, GR .
NAVAL RESEARCH LOGISTICS, 1984, 31 (01) :163-171
[10]   HEURISTIC 0-1 LINEAR-PROGRAMMING - EXPERIMENTAL COMPARISON OF 3 METHODS [J].
ZANAKIS, SH .
MANAGEMENT SCIENCE, 1977, 24 (01) :91-104