HEURISTICS AND REDUCTION METHODS FOR MULTIPLE CONSTRAINTS 0-1 LINEAR-PROGRAMMING PROBLEMS

被引：37
作者：
FREVILLE, A
PLATEAU, G
机构：
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1986年 / 24卷 / 02期
关键词：
D O I：
10.1016/0377-2217(86)90042-1
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：206 / 215
页数：10
相关论文
共 25 条
[1]   PIVOT AND COMPLEMENT - A HEURISTIC FOR 0-1 PROGRAMMING [J].
BALAS, E ;
MARTIN, CH .
MANAGEMENT SCIENCE, 1980, 26 (01) :86-96
[2]  
Camerini P.M., 1975, MATH PROGRAMMING STU, P26, DOI DOI 10.1007/BFB0120697
[3]   CALCULATING SURROGATE CONSTRAINTS [J].
DYER, ME .
MATHEMATICAL PROGRAMMING, 1980, 19 (03) :255-278
[4]   ALGORITHMUS 47 - AN ALGORITHM FOR THE SOLUTION OF THE 0-1 KNAPSACK-PROBLEM [J].
FAYARD, D ;
PLATEAU, G .
COMPUTING, 1982, 28 (03) :269-287
[5]  
FAYARD D, 1979, THESIS
[6]  
FLEISHER J, 1976, SIGMAP NEWSLETTER, V20
[7]  
FREVILLE A, 1983, THESIS
[8]  
FREVILLE A, 1982, ANO91 PUBL
[9]   A MULTIPHASE-DUAL ALGORITHM FOR ZERO-1 INTEGER PROGRAMMING PROBLEM [J].
GLOVER, F .
OPERATIONS RESEARCH, 1965, 13 (06) :879-&
[10]  
Glover F., 1977, DECIS SCI, V8, P156, DOI [10.1111/j.1540-5915.1977.tb01074.x, DOI 10.1111/J.1540-5915.1977.TB01074.X]
123