Showing 2024Show all
2 papers · 1 filter
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.OC2024
Obtaining properly Pareto optimal solutions of multiobjective optimization problems via the branch and bound method
Weitian Wu, Xinmin Yang
In multiobjective optimization, most branch and bound algorithms provide the decision maker with the whole Pareto front, and then decision maker could select a single solution fina…