ZERO-ONE INTEGER PROGRAMS WITH FEW CONSTRAINTS - EFFICIENT BRANCH AND BOUND ALGORITHMS

被引:4
作者
GAVISH, B [1 ]
PIRKUL, H [1 ]
机构
[1] OHIO STATE UNIV,ACAD FAC ACCOUNTING,COLUMBUS,OH 43210
关键词
D O I
10.1016/0377-2217(85)90113-4
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
9
引用
收藏
页码:35 / 43
页数:9
相关论文
共 8 条
[1]   AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].
BALAS, E ;
ZEMEL, E .
OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154
[2]   ZERO-ONE INTEGER PROGRAMS WITH FEW CONSTRAINTS - LOWER BOUNDING THEORY [J].
GAVISH, B ;
PIRKUL, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) :213-224
[3]  
GAVISH B, 1984, MULTICONSTRAINED GEN
[4]  
GAVISH B, 1982, MULTICONSTRAINT KNAP
[5]  
Gavish H. P. B., 1982, MANAGEMENT DISTRIBUT, P215
[6]   NEW GREEDY-LIKE HEURISTICS FOR THE MULTIDIMENSIONAL 0-1 KNAPSACK-PROBLEM [J].
LOULOU, R ;
MICHAELIDES, E .
OPERATIONS RESEARCH, 1979, 27 (06) :1101-1114
[7]  
MARTELLO S, 1977, EUROPEAN J OPERATION, V1, P168