Limit sets in global multiobjective optimization

DOI10.1080/02331934.2022.2092479OpenAlexW4283774417MaRDI QIDQ6146954

Oliver Stein, Gabriele Eichfelder

Publication date: 15 January 2024

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2022.2092479

zbMATH Keywords

truncationbranch-and-boundenclosurenondominated setmixed-Integer optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Strongly proper efficient solutions: efficient solutions with bounded trade-offs
• On the representation of the search region in multi-objective optimization
• Nonconvex separation theorems and some applications in vector optimization
• The multicriteria big cube small cube method
• Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
• Bound sets for biobjective combinatorial optimization problems
• Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy
• Theory of multiobjective optimization
• On two generalizations of Pareto minimality
• On several concepts for \(\varepsilon\)-efficiency
• Variational methods in partially ordered spaces
• Multi-objective branch and bound
• A general branch-and-bound framework for continuous global multiobjective optimization
• Vector Optimization
• Vector Optimization with Infimum and Supremum
• Variational Analysis
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Multicriteria optimization using a genetic algorithm for determining a Pareto set
• Multicriteria Optimization

This page was built for publication: Limit sets in global multiobjective optimization