Reference-point-based branch and bound algorithm for multiobjective optimization

DOI10.1007/s10898-023-01306-8arXiv2302.13470OpenAlexW4382072304MaRDI QIDQ6203550

Weitian Wu, Yang, Xinmin

Publication date: 5 April 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.13470

zbMATH Keywords

branch-and-bound algorithmmultiobjective optimizationreference pointpreference information

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• An approximation algorithm for convex multi-objective programming problems
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
• g-dominance: Reference point based dominance for multiobjective metaheuristics
• Lipschitzian optimization without the Lipschitz constant
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• A general branch-and-bound framework for continuous global multiobjective optimization
• On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
• A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm
• Interval Methods for Systems of Equations
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Multicriteria optimization using a genetic algorithm for determining a Pareto set

This page was built for publication: Reference-point-based branch and bound algorithm for multiobjective optimization