Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
From MaRDI portal
Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
Recommendations
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- Biobjective programming in optimization of interval linear programming
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Nonlinear multiple objective optimization: An algorithm and some theory
- Nonlinear and unconstrained multiple-objective optimization: Algorithm, computation, and application
Cites work
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A reliable affine relaxation method for global optimization
- An interval algorithm for multi-objective optimization
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- Constructive Interval Disjunction
- Contractor programming
- Evolutionary Algorithms for Solving Multi-Objective Problems
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm
- First order rejection tests for multiple-objective optimization
- 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
- Multi-objective branch and bound
- Node selection strategies in interval branch and bound algorithms
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Survey of multi-objective optimization methods for engineering
- Upper bounding in inner regions for global optimization under inequality constraints
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
Cited in
(5)- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- ibexMop
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
This page was built for publication: Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274873)
