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

DOI10.1007/s10107-022-01885-6zbMath1519.90216MaRDI QIDQ6044982

Clemens Rösner, Berthold Vöcking, Rene Beier, Heiko Röglin

Publication date: 25 May 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

bicriteria optimizationPareto-optimal solutionssmoothed analysisinteger optimization

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 label correcting approach for solving bicriterion shortest-path problems
• Efficiently computing succinct trade-off curves
• The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization
• Discrete Dynamic Programming and Capital Allocation
• Smoothed analysis of algorithms
• Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
• 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
• Probability and Computing
• Random knapsack in expected polynomial time

This page was built for publication: The smoothed number of Pareto-optimal solutions in bicriteria integer optimization