Feasible Path-Based Branch and Bound Algorithm for Highly Nonconvex Mixed-Integer Nonlinear Programming Problems

In this paper, a feasible path-based branch and bound (B&B) algorithm is presented for solving mixed-integer nonlinear programming problems with highly nonconvex nature. The main advantage of this novel algorithm, comparing to the conventional branch and bound algorithms, is that when solving a...

Full description

Bibliographic Details
Main Authors: Chao Liu, Yingjie Ma, Dongda Zhang, Jie Li
Format: Article
Language:English
Published: AIDIC Servizi S.r.l. 2022-09-01
Series:Chemical Engineering Transactions
Online Access:https://www.cetjournal.it/index.php/cet/article/view/12722