A feasible path-based branch and bound algorithm for strongly nonconvex MINLP problems
In this paper, a feasible path-based branch and bound (B&B) algorithm is proposed to solve mixed-integer nonlinear programming problems with highly nonconvex nature through integration of the previously proposed hybrid feasible-path optimisation algorithm and the branch and bound method. The...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Frontiers Media S.A.
2022-09-01
|
| Series: | Frontiers in Chemical Engineering |
| Subjects: | |
| Online Access: | https://www.frontiersin.org/articles/10.3389/fceng.2022.983162/full |