Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On the representation of the search region in multi-objective optimization
Approximation with a fixed number of solutions of some multiobjective maximization problems
Covers and approximations in multiobjective optimization
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
Approximately dominating representatives
On the completeness and constructiveness of parametric characterizations to vector optimization problems
Approximate Pareto sets of minimal size for multi-objective optimization problems
A survey and annotated bibliography of multiobjective combinatorial optimization
On scalarizing functions in multiobjective optimization
One-exact approximate Pareto sets
The power of the weighted sum scalarization for approximating multiobjective optimization problems
A general approximation method for bicriteria minimization problems
Efficiently computing succinct trade-off curves
How good is the Chord algorithm?
The Design of Approximation Algorithms
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
Approximability and Hardness in Multi-objective Optimization
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
The Nature and Use of the Harmonic Mean
Approximation Methods for Multiobjective Optimization Problems: A Survey
Multicriteria Optimization
Approximating biobjective minimization problems using general ordering cones