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

A well-established heuristic approach for solving bicriteria optimization problems is to enumerate the set of Pareto-optimal solutions. The heuristics following this principle are often successful in practice. Their running time, however, depends on the number of enumerated solutions, which is expon...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming 2023-06, Vol.200 (1), p.319-355
Hauptverfasser:	Beier, René, Röglin, Heiko, Rösner, Clemens, Vöcking, Berthold
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Calculus of Variations and Optimal Control Optimization Combinatorics Full Length Paper Heuristic methods Integers Knapsack problem Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Pareto efficiency Pareto optimum Polynomials Random noise Shortest-path problems Theoretical
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!