Smoothed Analysis of Multiobjective Optimization

DOI10.1109/FOCS.2009.21MaRDI QIDQ5171226zbMATH OpenOpenAlexFDO

Authors Heiko Röglin, Shang-Hua Teng

Publication date 25 July 2014

Published in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/focs.2009.21

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Multi-objective and goal programming (90C29)

Cited in

(7)

• Smoothed analysis of partitioning algorithms for Euclidean functionals
• Complexity of source-sink monotone 2-parameter min cut
• The smoothed number of Pareto-optimal solutions in non-integer bicriteria optimization
• Lower bounds for the smoothed number of Pareto optimal solutions
• Smoothed analysis of local search algorithms
• The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
• Parameterized algorithms for computing Pareto sets

This page was built for publication: Smoothed Analysis of Multiobjective Optimization

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