Papers › Computing the Complete Pareto Front
Computing the Complete Pareto Front
Ruediger Ehlers
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We give an efficient algorithm to enumerate all elements of a Pareto front in a multi-objective optimization problem in which the space of values is finite for all objectives. Our algorithm uses a feasibility check for a search space element as an oracle and minimizes the number of oracle calls that are necessary to identify the Pareto front of the problem. Given a k-dimensional search space in which each dimension has n elements, it needs p ·(k ·⌈log₂ n ⌉+ 1) + ψ(p) oracle calls, where p is the size of the Pareto front and ψ(p) is the number of greatest elements of the part of the search space that is not dominated by the Pareto front elements. We show that this number of oracle calls is essentially optimal as approximately p ·k ·log₂ n oracle calls are needed to identify the Pareto front elements in sparse Pareto sets and ψ(p) calls are needed to show that no element is missing in the set of Pareto front elements found.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections