Runtime analysis shows CPR-NSGA-II with cross-party recombination finds common Pareto-optimal solutions in O(n log n) expected evaluations on MP-JCG versus Θ(n²) for baseline mutation, with layered support-cover bounds and instance-parameterized runtime for BPBOMST.
The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Opti- mization Problem, in: Proc
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
Runtime analysis shows CPR-NSGA-II with cross-party recombination finds common Pareto-optimal solutions in O(n log n) expected evaluations on MP-JCG versus Θ(n²) for baseline mutation, with layered support-cover bounds and instance-parameterized runtime for BPBOMST.