A branch and bound algorithm for continuous multiobjective optimization problems using general ordering cones

Many existing branch and bound algorithms for multiobjective optimization problems require a significant computational cost to approximate the entire Pareto optimal solution set. In this paper, we propose a new branch and bound algorithm that approximates a part of the Pareto optimal solution set by...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 326; H. 1; S. 28 - 41
Hauptverfasser:	Wu, Weitian, Yang, Xinmin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.10.2025
Schlagworte:	Branch and bound algorithm Efficient solution Global optimization Multiple objective programming Ordering cone Global optimization 90C30 Efficient solution Multiple objective programming 90C29 Branch and bound algorithm 90C26 Ordering cone
ISSN:	0377-2217
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!