The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization

DOI10.1007/978-3-319-55911-7_39zbMath1462.90122OpenAlexW2603664661MaRDI QIDQ2988849

Clemens Rösner, Heiko Röglin

Publication date: 19 May 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_39

zbMATH Keywords

exponential number of Pareto-optimal solutions, polynomially bounded

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (1)

The smoothed number of Pareto-optimal solutions in bicriteria integer optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest paths in networks with vector weights
• Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
• A survey and annotated bibliography of multiobjective combinatorial optimization
• A label correcting approach for solving bicriterion shortest-path problems
• Discrete Dynamic Programming and Capital Allocation
• Smoothed analysis of algorithms
• Pareto Optimal Solutions for Smoothed Analysts
• Smoothed Analysis of Multiobjective Optimization
• Improved smoothed analysis of multiobjective optimization
• The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
• Random knapsack in expected polynomial time

This page was built for publication: The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization