| [1] |
ALFAKI Mohammed, HAUGLAND Dag. Strong formulations for the pooling problem[J]. Journal of Global Optimization, 2013, 56(3): 897-916.
|
| [2] |
HAVERLY C A. Studies of the behavior of recursion for the pooling problem[J]. ACM SIGMAP Bulletin, 1978(25): 19-28.
|
| [3] |
Aharon BEN-TAL, EIGER Gideon, GERSHOVITZ Vladimir. Global minimization by reducing the duality gap[J]. Mathematical Programming, 1994, 63(1): 193-212.
|
| [4] |
QUESADA I, GROSSMANN I E. Global optimization of bilinear process networks with multicomponent flows[J]. Computers & Chemical Engineering, 1995, 19(12): 1219-1242.
|
| [5] |
TAWARMALANI M, SAHINIDIS N V. Convexification and global optimization in continuous and mixed-integer nonlinear programming[M]. Boston, MA: Springer, 2002.
|
| [6] |
KANNAN Ravindran, MONMA Clyde L. On the computational complexity of integer programming problems[M]//Lecture Notes in Economics and Mathematical Systems. Berlin, Heidelberg: Springer,1978.
|
| [7] |
SHERALI H D, ALAMEDDINE Amine. A new reformulation-linearization technique for bilinear programming problems[J]. Journal of Global Optimization, 1992, 2(4): 379-410.
|
| [8] |
SMITH E M B, PANTELIDES C C. A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs[J]. Computers & Chemical Engineering, 1999, 23(4/5): 457-478.
|
| [9] |
SASS Susanne, MITSOS Alexander, BONGARTZ Dominik, et al. A branch-and-bound algorithm with growing datasets for large-scale parameter estimation[J]. European Journal of Operational Research, 2024, 316(1): 36-45.
|
| [10] |
MORRISON David R, JACOBSON Sheldon H, SAUPPE Jason J, et al. Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning[J]. Discrete Optimization, 2016, 19: 79-102.
|
| [11] |
KARUPPIAH Ramkumar, GROSSMANN Ignacio E. Global optimization for the synthesis of integrated water systems in chemical processes[J]. Computers & Chemical Engineering, 2006, 30(4): 650-673.
|
| [12] |
CASTRO Pedro M. Tightening piecewise McCormick relaxations for bilinear problems[J]. Computers & Chemical Engineering, 2015, 72: 300-311.
|
| [13] |
SOARES Inês, ALVES Maria João, HENGGELER ANTUNES Carlos. A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem[J]. European Journal of Operational Research, 2021, 291(1): 52-66.
|
| [14] |
NASCIMENTO Mariá C V, DE CARVALHO André C P L F. Spectral methods for graph clustering—A survey[J]. European Journal of Operational Research, 2011, 211(2): 221-231.
|
| [15] |
Bochuan LYU, HICKS Illya V, HUCHETTE Joey. Building formulations for piecewise linear relaxations of nonlinear functions[EB/OL]. (2023-04-27)[2024-09-18]..
|
| [16] |
SUNDAR Kaarthik, HARSHA Nagarajan, JEFF Linderoth, et al. Piecewise polyhedral formulations for a multilinear term[J]. Operations Research Letters, 2021, 49(1):144-149.
|
| [17] |
DURAN Marco A, GROSSMANN Ignacio E. An outer-approximation algorithm for a class of mixed-integer nonlinear programs[J]. Mathematical Programming, 1986, 36(3): 307-339.
|
| [18] |
GEOFFRION A M. Generalized benders decomposition[J]. Journal of Optimization Theory and Applications, 1972, 10(4): 237-260.
|
| [19] |
KRONQVIST J, MISENER R. A disjunctive cut strengthening technique for convex MINLP[J]. Optimization and Engineering, 2021, 22: 1315-1345.
|
| [20] |
SHAMI Tareq M, EL-SALEH Ayman A, ALSWAITTI Mohammed, et al. Particle swarm optimization: A comprehensive survey[J]. IEEE Access, 2022, 10: 10031-10061.
|
| [21] |
LIU Xinggao, HU Yunqing, FENG Jianghua, et al. A novel penalty approach for nonlinear dynamic optimization problems with inequality path constraints[J]. IEEE Transactions on Automatic Control, 2014, 59(10): 2863-2867.
|
| [22] |
ZHOU Wenhao, CHEN Fayuan, JI Xiaoyuan, et al. A Pareto-based discrete particle swarm optimization for parallel casting workshop scheduling problem with fuzzy processing time[J]. Knowledge-Based Systems, 2022, 256: 109872.
|
| [23] |
FU Jun, TIAN Fangyin. Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints[J]. Automatica, 2021, 127: 109516.
|
| [24] |
MURRAY Walter, Kien-Ming NG. An algorithm for nonlinear optimization problems withbinary variables[J]. Computational Optimization and Applications, 2010, 47(2): 257-288.
|
| [25] |
GE Dongdong, JIANG Xiaoye, YE Yinyu. A note on the complexity of lpminimization[J]. Mathematical Programming, 2011, 129(2): 285-299.
|
| [26] |
CHEN Xiaojun, GE Dongdong, WANG Zizhuo, et al. Complexity of unconstrained L2—L P minimization[J]. Mathematical Programming, 2014, 143: 371-383.
|
| [27] |
何银仁, 解增忠. 炼油生产经营优化应用案例[M]. 北京: 中国石化出版社, 2018.
|
|
HE Yinren, XIE Zengzhong. Optimization application cases in oil refining production and management[M]. Beijing: China Petrochemical Press, 2018.
|