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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 326; no. 1; pp. 28 - 41
Main Authors:	Wu, Weitian, Yang, Xinmin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!