Approximating multiobjective optimization problems: how exact can you be?
From MaRDI portal
Recommendations
- One-exact approximate Pareto sets
- Approximation methods for multiobjective and parametric optimization problems
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
- Approximation with a fixed number of solutions of some multiobjective maximization problems
Cites work
- scientific article; zbMATH DE number 1530340 (Why is no real title available?)
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Approximately dominating representatives
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Approximation algorithms for combinatorial problems
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Dominating sets in \(k\)-majority tournaments.
- Efficiently computing succinct trade-off curves
- One-exact approximate Pareto sets
- Optimization, approximation, and complexity classes
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
Cited in
(1)
This page was built for publication: Approximating multiobjective optimization problems: how exact can you be?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616269)
