REDUCTION OF INTEGER POLYNOMIAL PROGRAMMING PROBLEMS TO ZERO-ONE LINEAR PROGRAMMING

被引：153
作者：
WATTERS, LJ
机构：
来源：
OPERATIONS RESEARCH | 1967年 / 15卷 / 06期
关键词：
D O I：
10.1287/opre.15.6.1171
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：1171 / &
相关论文
共 10 条
[1]   AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J].
BALAS, E .
OPERATIONS RESEARCH, 1965, 13 (04) :517-&
[2]   INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].
BALINSKI, ML .
MANAGEMENT SCIENCE, 1965, 12 (03) :253-313
[3]   SURVEY OF INTEGER PROGRAMMING [J].
BEALE, EML .
OPERATIONAL RESEARCH QUARTERLY, 1965, 16 (02) :219-228
[4]  
GEOFFRION A, RM4783PR RAND CORP
[5]   A MULTIPHASE-DUAL ALGORITHM FOR ZERO-1 INTEGER PROGRAMMING PROBLEM [J].
GLOVER, F .
OPERATIONS RESEARCH, 1965, 13 (06) :879-&
[6]  
HILLIER FS, NONR22589 CONTR
[7]   BRANCH-AND-BOUND METHODS - A SURVEY [J].
LAWLER, EL ;
WOOD, DE .
OPERATIONS RESEARCH, 1966, 14 (04) :699-+
[8]  
Petersen C.C., 1967, MANAGE SCI, V13, P736, DOI DOI 10.1287/MNSC.13.9.736
[9]  
Reiter S., 1966, Management Science, V12, P829
[10]  
WATTERS LJ, THESIS ARIZONA STAT
1