Advancements in the computation of enclosures for multi-objective optimization problems
From MaRDI portal
Publication:6113330
DOI10.1016/j.ejor.2023.02.032MaRDI QIDQ6113330
Gabriele Eichfelder, Leo Warnow
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
nonlinear programmingmultiple objective programmingmixed-integer programmingenclosurewarm start strategies
Cites Work
- On the representation of the search region in multi-objective optimization
- An approximation algorithm for convex multi-objective programming problems
- Bound sets for biobjective combinatorial optimization problems
- Variational methods in partially ordered spaces
- Bilevel programming for generating discrete representations in multiobjective optimization
- Discrete representation of non-dominated sets in multi-objective linear programming
- Efficient computation of the search region in multi-objective optimization
- Unbiased approximation in multicriteria optimization
- Scalarizing vector optimization problems
- A general branch-and-bound framework for continuous global multiobjective optimization
- Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- An objective space cut and bound algorithm for convex multiplicative programmes
- Efficient computation of expected hypervolume improvement using box decomposition algorithms
- A Benson type algorithm for nonconvex multiobjective programming problems
- Approximation methods in multiobjective programming
- Computing representations using hypervolume scalarizations
- A deterministic algorithm for global multi-objective optimization
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Adaptive Scalarization Methods in Multiobjective Optimization
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- Twenty years of continuous multiobjective optimization in the twenty-first century
This page was built for publication: Advancements in the computation of enclosures for multi-objective optimization problems
