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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Chemical engineering transactions Jg. 94
Hauptverfasser:	Chao Liu, Yingjie Ma, Dongda Zhang, Jie Li
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	AIDIC Servizi S.r.l 01.09.2022
ISSN:	2283-9216
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!