Limit sets in global multiobjective optimization

DOI10.1080/02331934.2022.2092479MaRDI QIDQ6146954zbMATH OpenOpenAlexFDO

Authors Gabriele Eichfelder, Oliver Stein

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

branch-and-boundenclosuremixed-Integer optimizationnondominated settruncation

Mathematics Subject Classification ID

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

Recommendations

• A general branch-and-bound framework for continuous global multiobjective optimization
• Multi-objective branch and bound
• scientific article; zbMATH DE number 852336
• Branch and probability bound methods in multi-objective optimization
• Branch-and-bound and objective branching with three or more objectives

Cites work

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

Cited in

(2)

• On necessary optimality conditions for sets of points in multiobjective optimization
• A branch and bound algorithm for continuous multiobjective optimization problems using general ordering cones

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146954)