COEFFICIENT REDUCTION FOR KNAPSACK-LIKE CONSTRAINTS IN 0-1 PROGRAMS WITH VARIABLE UPPER-BOUNDS

被引：11
|
作者：
DIETRICH, BL
ESCUDERO, LF
机构：
[1] IBM Research, T.J. Watson Research Center, Yorktown Heights, NY 10598
来源：
OPERATIONS RESEARCH LETTERS | 1990年 / 9卷 / 01期
关键词：
0-1; programming; coefficient reduction; cutting planes; knapsack constraints; variable upper bounds;
D O I：
10.1016/0167-6377(90)90034-3
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The notion of coefficient reduction is extended for 0-1 knapsack-like constraints by taking advantage of the special structure of variable bounding constraints. Our procedure produces reductions not detected by myopic coefficient reduction methods. © 1990.
引用
收藏
页码：9 / 14
页数：6
相关论文
共 50 条
12345