A PRIMAL-DUAL CUTTING-PLANE ALGORITHM FOR ALL-INTEGER PROGRAMMING

被引:7
作者
GHANDFOROUSH, P
AUSTIN, LM
机构
关键词
D O I
10.1002/nav.3800280405
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:559 / 566
页数:8
相关论文
共 7 条
[1]  
AUSTIN LM, 1979, UNPUB BOUNDED DESCEN
[2]  
GLOVER F, 1967, J RES NBS B, V71, P167
[3]  
Gomory R.E, 1963, RECENT ADV MATH PROG, P269
[4]  
HALDI J, 1964, 43 STANF U GRAD SCH
[5]   INTEGER LINEAR PROGRAMMING - STUDY IN COMPUTATIONAL EFFICIENCY [J].
TRAUTH, CA ;
WOOLSEY, RE .
MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 15 (09) :481-493
[6]  
WAHI PN, 1969, 28 YAL U DEP ADM SCI
[7]   A SIMPLIFIED PRIMAL (ALL-INTEGER) INTEGER PROGRAMMING ALGORITHM [J].
YOUNG, RD .
OPERATIONS RESEARCH, 1968, 16 (04) :750-&