Lower Bounds for the Smoothed Number of Pareto Optimal Solutions

DOI10.1007/978-3-642-20877-5_41zbMath1332.90232arXiv1012.1163OpenAlexW1817061570MaRDI QIDQ3010422

Heiko Röglin, Tobias Brunsch

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.1163

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites Work

• Smoothed analysis of algorithms
• Smoothed Analysis of Multiobjective Optimization
• Multicriteria Optimization
• The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
• Random knapsack in expected polynomial time

This page was built for publication: Lower Bounds for the Smoothed Number of Pareto Optimal Solutions