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...
Saved in:
| Published in: | Chemical engineering transactions Vol. 94 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
AIDIC Servizi S.r.l
01.09.2022
|
| ISSN: | 2283-9216 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!