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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 326; číslo 1; s. 28 - 41
Hlavní autori:	Wu, Weitian, Yang, Xinmin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.10.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!