2 papers
math.OC2024
A Branch and Bound Algorithm for Multiobjective Optimization Problems Using General Ordering Cones
Weitian Wu, Xinmin Yang
Many existing branch and bound algorithms for multiobjective optimization problems require a significant computational cost to approximate the entire Pareto optimal solution set. I…
math.OC2022
The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization
Wei-tian Wu, Xin-min Yang
A hybrid framework combining the branch and bound method with multiobjective evolutionary algorithms is proposed for nonconvex multiobjective optimization. The hybridization exploi…