BRANCH AND BOUND EXPERIMENTS IN CONVEX NONLINEAR INTEGER PROGRAMMING

被引:292
作者
GUPTA, OK [1 ]
RAVINDRAN, A [1 ]
机构
[1] UNIV OKLAHOMA,SCH IND ENGN,NORMAN,OK 73019
关键词
D O I
10.1287/mnsc.31.12.1533
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
MATHEMATICAL PROGRAMMING, NONLINEAR
引用
收藏
页码:1533 / 1546
页数:14
相关论文
共 18 条
[1]  
Abadie J., 1969, OPTIMIZATION, P37
[2]  
B├a┬nichou M., 1971, MATH PROGRAM, V1, P76, DOI DOI 10.1007/BF01584074
[3]  
COLVILLE AR, 1968, IBM3202949 NEW YORK
[4]   A SURVEY OF METHODS FOR PURE NON-LINEAR INTEGER PROGRAMMING [J].
COOPER, MW .
MANAGEMENT SCIENCE, 1981, 27 (03) :353-361
[5]   COMPARISON OF NUMERICAL OPTIMIZATION METHODS FOR ENGINEERING DESIGN [J].
EASON, ED ;
FENTON, RG .
JOURNAL OF ENGINEERING FOR INDUSTRY-TRANSACTIONS OF THE ASME, 1974, 96 (01) :196-200
[6]  
Fiacco A., 1990, NONLINEAR PROGRAMMIN
[7]  
GABRIELE GA, 1976, MODERN DESIGN SERIES, V1
[8]   IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS [J].
GLOVER, F .
MANAGEMENT SCIENCE, 1975, 22 (04) :455-460
[9]  
Gupta O. K., 1983, Opsearch, V20, P189
[10]  
GUPTA OK, 1980, THESIS PURDUE U W LA