A HIERARCHY OF RELAXATIONS BETWEEN THE CONTINUOUS AND CONVEX-HULL REPRESENTATIONS FOR ZERO-ONE PROGRAMMING-PROBLEMS

被引:567
作者
SHERALI, HD [1 ]
ADAMS, WP [1 ]
机构
[1] CLEMSON UNIV,DEPT MATH SCI,CLEMSON,SC 29634
关键词
D O I
10.1137/0403036
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:411 / 430
页数:20
相关论文
共 54 条
[1]   A TIGHT LINEARIZATION AND AN ALGORITHM FOR ZERO-ONE QUADRATIC-PROGRAMMING PROBLEMS [J].
ADAMS, WP ;
SHERALI, HD .
MANAGEMENT SCIENCE, 1986, 32 (10) :1274-1290
[2]  
ADAMS WP, 1987, IN PRESS OPER RES
[3]   FACETS OF KNAPSACK POLYTOPE [J].
BALAS, E .
MATHEMATICAL PROGRAMMING, 1975, 8 (02) :146-164
[4]   DISJUNCTIVE PROGRAMMING AND A HIERARCHY OF RELAXATIONS FOR DISCRETE OPTIMIZATION PROBLEMS [J].
BALAS, E .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (03) :466-486
[5]  
Balas E., 1984, Mathematical Programming. Proceedings of the International Congress on Mathematical Programming, P13
[6]  
BALAS E, 1977, SIAM J APPL MATH, V34, P119
[7]  
BALAS E, 1976, I NAZIONALE ALTA MAT, V19, P11
[8]  
BALAS E, 1985, MSRR496R GSIA CARN U
[9]  
BALAS E, 1983, MSRS492 GSIA CARN U
[10]  
Chvatal V., 1973, Discrete Mathematics, V4, P305, DOI 10.1016/0012-365X(73)90167-2