A SIMULATED ANNEALING APPROACH TO THE MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEM

被引:95
作者
DREXL, A
机构
关键词
D O I
10.1007/BF02242185
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:1 / 8
页数:8
相关论文
共 24 条
[1]  
Aho A.V., 1983, DATA STRUCTURES ALGO
[2]   PIVOT AND COMPLEMENT - A HEURISTIC FOR 0-1 PROGRAMMING [J].
BALAS, E ;
MARTIN, CH .
MANAGEMENT SCIENCE, 1980, 26 (01) :86-96
[3]   AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].
BALAS, E ;
ZEMEL, E .
OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154
[4]   THE ASYMPTOTIC-BEHAVIOR OF QUADRATIC SUM ASSIGNMENT PROBLEMS - A STATISTICAL-MECHANICS APPROACH [J].
BONOMI, E ;
LUTTON, JL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 26 (02) :295-300
[5]  
DOMSCHKE W, IN PRESS OR SPEKTRUM
[6]   HEURISTICS AND REDUCTION METHODS FOR MULTIPLE CONSTRAINTS 0-1 LINEAR-PROGRAMMING PROBLEMS [J].
FREVILLE, A ;
PLATEAU, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 24 (02) :206-215
[7]  
FREVILLE A, 1982, ANO91 U SCI TECHN LI
[8]  
FREVILLE A, 1987, PREPUBLICATIONS INFO, V72
[9]   APPROXIMATION ALGORITHMS FOR THE M-DIMENSIONAL 0-1 KNAPSACK-PROBLEM - WORST-CASE AND PROBABILISTIC ANALYSES [J].
FRIEZE, AM ;
CLARKE, MRB .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 15 (01) :100-109
[10]  
Garey MR., 1979, COMPUTERS INTRACTABI