Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
From MaRDI portal
Publication:1753511
DOI10.1016/j.ejor.2016.05.045zbMath1403.90612OpenAlexW2411418906MaRDI QIDQ1753511
Alexandre Goldsztejn, Christophe Jermann, Laurent Granvilliers, Benjamin T. Martin
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.045
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items (6)
Numerical certification of Pareto optimality for biobjective nonlinear problems ⋮ A survey of interval algorithms for solving multicriteria analysis problems ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Nonconvex constrained optimization by a filtering branch and bound
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the representation of the search region in multi-objective optimization
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- An interval algorithm for multi-objective optimization
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- An efficient and safe framework for solving optimization problems
- Bound sets for biobjective combinatorial optimization problems
- Adaptive constructive interval disjunction: algorithms and experiments
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- A note on epsilon-inflation
- Nonlinear multiobjective optimization
- Rigorous global search: continuous problems
- First order rejection tests for multiple-objective optimization
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Second-order sufficient optimality conditions for local and global nonlinear programming
- Constructive Interval Disjunction
- Algorithm 852
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Complete search in continuous global optimization and constraint satisfaction
- Multicriteria Optimization
This page was built for publication: Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
