CUTTING PLANE ALGORITHM FOR BILINEAR PROGRAMMING PROBLEM

被引:39
作者
VAISH, H
SHETTY, CM
机构
[1] CALIF STATE UNIV NORTHRIDGE, NORTHRIDGE, CA 91324 USA
[2] GEORGIA INST TECHNOL, ATLANTA, GA 30332 USA
关键词
D O I
10.1002/nav.3800240107
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:83 / 94
页数:12
相关论文
共 31 条
[1]   INTERSECTION CUTS - NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING [J].
BALAS, E .
OPERATIONS RESEARCH, 1971, 19 (01) :19-+
[2]  
BALAS E, 1973, GSIA299 CARN MELL U
[3]  
Balas E, 1972, MATH PROGRAMMING, V2, P330
[4]  
BALAS E, 1974, GSIA348 CARN MELL U
[5]  
BALAS E, 1972, GSIA278 CARN MELL U
[6]   POLAROIDS - NEW TOOL IN NON-CONVEX AND IN INTEGER PROGRAMMING [J].
BURDET, CA .
NAVAL RESEARCH LOGISTICS, 1973, 20 (01) :13-24
[7]  
BURDET CA, 1974, MATHEMATICAL PROGRAM
[8]  
BURDET CA, TO BE PUBLISHED
[9]   SOLVING CERTAIN NONCONVEX QUADRATIC MINIMIZATION PROBLEMS BY RANKING EXTREME POINTS [J].
CABOT, AV ;
FRANCIS, RL .
OPERATIONS RESEARCH, 1970, 18 (01) :82-&
[10]   THE MAXIMIZATION OF A QUADRATIC FUNCTION OF VARIABLES SUBJECT TO LINEAR INEQUALITIES [J].
CANDLER, W ;
TOWNSLEY, RJ .
MANAGEMENT SCIENCE, 1964, 10 (03) :515-523