Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization

DOI10.1007/S10898-025-01479-4MaRDI QIDQ6966832zbMATH OpenFDO

Authors I. Araya, Victor Reyes, Javier Montero

Publication date 27 June 2025

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

zbMATH Keywords

multi-objective optimizationbranch-and-boundinterval methods

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• scientific article; zbMATH DE number 1595639 (Why is no real title available?)
• scientific article; zbMATH DE number 3662118 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• scientific article; zbMATH DE number 2222824 (Why is no real title available?)
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• A general branch-and-bound framework for continuous global multiobjective optimization
• A literature survey of benchmark functions for global optimisation problems
• A reliable affine relaxation method for global optimization
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
• Algorithm 681: INTBIS, a portable interval Newton/bisection package
• An approximation algorithm for multi-objective optimization problems using a box-coverage
• An interval algorithm for multi-objective optimization
• Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
• Constructive Interval Disjunction
• Contractor programming
• Multi-objective optimization using evolutionary algorithms
• Multicriteria optimization using a genetic algorithm for determining a Pareto set
• Non-convex multi-objective optimization
• Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
• Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Scalarizations for adaptively solving multi-objective optimization problems
• Subdivision Direction Selection in Interval Methods for Global Optimization
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers

This page was built for publication: Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966832)