Partitioning procedures for solving mixed-variables programming problems

被引：1589
作者：
Benders, J. F. [1 ]
机构：
[1] Koninklijke Shell Exptl Prod Lab, Amsterdam, Netherlands
来源：
COMPUTATIONAL MANAGEMENT SCIENCE | 2005年 / 2卷 / 01期
关键词：
D O I：
10.1007/s10287-004-0020-y
中图分类号：
O1 [数学]; C [社会科学总论];
学科分类号：
03 ; 0303 ; 0701 ; 070101 ;
摘要：
[No abstract available]
引用
收藏
页码：3 / 19
页数：17
相关论文
共 14 条
[1]  
Beale EML, 1958, 19 STAT TECHN RES GR
[2]  
Benders JF, 1959, RAND S MATH PROGR 16
[3]  
Benders JF, 1960, THESIS
[4]   DECOMPOSITION PRINCIPLE FOR LINEAR-PROGRAMS [J].
DANTZIG, GB ;
WOLFE, P .
OPERATIONS RESEARCH, 1960, 8 (01) :101-111
[5]   ON THE SIGNIFICANCE OF SOLVING LINEAR-PROGRAMMING PROBLEMS WITH SOME INTEGER VARIABLES [J].
DANTZIG, GB .
ECONOMETRICA, 1960, 28 (01) :30-44
[6]  
Gass SI., 1958, LINEAR PROGRAMMING M
[7]  
Goldman AJ, 1956, ANN MATH STUD, V38, P41
[8]  
Gomory R.E., 1960, P1885 RAND CORP
[9]   A NONLINEAR-PROGRAMMING TECHNIQUE FOR THE OPTIMIZATION OF CONTINUOUS PROCESSING SYSTEMS [J].
GRIFFITH, RE ;
STEWART, RA .
MANAGEMENT SCIENCE, 1961, 7 (04) :379-392
[10]   THE CUTTING-PLANE METHOD FOR SOLVING CONVEX PROGRAMS [J].
KELLEY, JE .
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (04) :703-712
12