Approximating multiobjective optimization problems: how exact can you be?

DOI10.1007/s00186-023-00836-xMaRDI QIDQ6616269

Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten, Arne Herzel

Publication date: 9 October 2024

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

approximationmultiobjective optimizationintractabilityefficient set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Approximately dominating representatives
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
• Optimization, approximation, and complexity classes
• Approximation algorithms for combinatorial problems
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• One-exact approximate Pareto sets
• Dominating sets in \(k\)-majority tournaments.
• Efficiently computing succinct trade-off curves
• Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
• Approximation Methods for Multiobjective Optimization Problems: A Survey

Related Items (1)

Special issue on exact and approximation methods for mixed-integer multi-objective optimization

This page was built for publication: Approximating multiobjective optimization problems: how exact can you be?