Advancements in the computation of enclosures for multi-objective optimization problems
- 24 February 2023
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 310 (1) , 315-327
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft (432218631)
This publication has 23 references indexed in Scilit:
- Efficient computation of the search region in multi-objective optimizationEuropean Journal of Operational Research, 2017
- On the representation of the search region in multi-objective optimizationEuropean Journal of Operational Research, 2015
- A deterministic algorithm for global multi-objective optimizationOptimization Methods and Software, 2013
- An objective space cut and bound algorithm for convex multiplicative programmesJournal of Global Optimization, 2013
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer ProgramsManagement Science, 2010
- An approximation algorithm for convex multi-objective programming problemsJournal of Global Optimization, 2010
- Bound sets for biobjective combinatorial optimization problemsComputers & Operations Research, 2007
- Approximation Methods in Multiobjective ProgrammingJournal of Optimization Theory and Applications, 2005
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization ProblemsSIAM Journal on Optimization, 1998
- Scalarizing vector optimization problemsJournal of Optimization Theory and Applications, 1984