Recent advances in multiobjective optimization

Authors:
Christos Zaroliagis
Affiliations:
Computer Technology Institute, Patras, Greece
Venue:
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Year:
2005

Citing 6
Cited 1

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Many birds with one stone: multi-objective approximation algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bicriteria network design problems

Journal of Algorithms
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Efficient information gathering on the Internet

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Multicriteria Optimization

Multicriteria Optimization

A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiobjective (or multicriteria) optimization is a research area with rich history and under heavy investigation within Operations Research and Economics in the last 60 years [1,2]. Its object of study is to investigate solutions to combinatorial optimization problems that are evaluated under several objective functions – typically defined on multidimensional attribute (cost) vectors. In multiobjective optimization, we are interested not in finding a single optimal solution, but in computing the trade-off among the different objective functions, called the Pareto set (or curve)${\mathcal P}$, which is the set of all feasible solutions whose vector of the various objectives is not dominated by any other solution.