{"paper":{"title":"Computing the Complete Pareto Front","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ruediger Ehlers","submitted_at":"2015-12-16T15:23:16Z","abstract_excerpt":"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 \\cdot (k \\cdot \\lceil \\log_2 n \\rceil + 1) + \\psi(p)$ oracle calls, where $p$ is the size of the Pareto front and $\\psi(p)$ is the number of greatest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05207","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}