The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
From MaRDI portal
Publication:5429257
DOI10.1007/978-3-540-72792-7_5zbMath1136.90400OpenAlexW1480622933MaRDI QIDQ5429257
Heiko Röglin, Berthold Vöcking, Rene Beier
Publication date: 29 November 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://publications.rwth-aachen.de/record/115544
Integer programming (90C10) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
On the tractability of shortest path problems in weighted edge-coloured graphs ⋮ Smoothed Analysis of Local Search Algorithms ⋮ Analysis of FPTASes for the multi-objective shortest path problem ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ On smoothed analysis of quicksort and Hoare's find ⋮ The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization ⋮ A universally-truthful approximation scheme for multi-unit auctions ⋮ Lower Bounds for the Smoothed Number of Pareto Optimal Solutions ⋮ The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem ⋮ Unnamed Item
This page was built for publication: The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
