Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms

DOI10.1007/S10898-019-00768-ZzbMath1429.90066OpenAlexW2937126562MaRDI QIDQ2274873

Jose Campusano, Ignacio J. Araya, Damir Aliquintui

Publication date: 1 October 2019

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

Full work available at URL: https://doi.org/10.1007/s10898-019-00768-z

zbMATH Keywords

multiobjective optimizationinterval methodsbranch \& bound

Mathematics Subject Classification ID

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

Related Items (2)

Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ ibexMop

Uses Software

• FEMOEA
• GitHub

Cites Work

• Unnamed Item
• Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
• Survey of multi-objective optimization methods for engineering
• An interval algorithm for multi-objective optimization
• Upper bounding in inner regions for global optimization under inequality constraints
• A reliable affine relaxation method for global optimization
• FEMOEA: a fast and efficient multi-objective evolutionary algorithm
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
• Contractor programming
• On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
• Multi-objective branch and bound
• Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
• First order rejection tests for multiple-objective optimization
• Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
• Constructive Interval Disjunction
• Subdivision Direction Selection in Interval Methods for Global Optimization
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Node selection strategies in interval branch and bound algorithms

This page was built for publication: Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms