Research map / Learning theory and algorithms / Combinatorial and search optimization
Representative Solutions for Bi-Objective Optimisation
Emir Demirovi?, Nicolas Schwind
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| compute k=1 representative solution instead of full Pareto front (epsilon-method) | bi-objective ILP · SC(n=1,000) | runtime (s): 678 -> 72 | Improved |
| compute k=1 representative solution instead of full Pareto front | bi-objective ILP · SC(n=2,000) | runtime (s): 13,541 -> 460 | Improved |
| compute k=1 representative solution instead of full Pareto front | bi-objective ILP · RCPSP-90 | runtime (s): 9,334 -> 514 | Improved |
| compute k=5 representative solutions instead of full Pareto front | bi-objective ILP · RCPSP-60 | runtime (s): 2,632 -> 898 | Improved |
| compute k=5 representative solutions instead of full Pareto front | bi-objective ILP · RCPSP-30 | runtime (s): 56 -> 56 | No clear effect |
| compute k=5 representative solutions instead of full Pareto front | bi-objective ILP · SC(n=1,000) | # NP-hard solver calls: 1,407 -> 495 | Improved |
| compute k=5 representative solutions instead of full Pareto front | bi-objective ILP · SC(n=2,000) | # NP-hard solver calls: 4,191 -> 530 | Improved |
| increase k from 1 to 5 | k-representative algorithm · SC(n=1,000) | runtime (s): 72 -> 264 | Hurt |
| increase k from 1 to 5 | k-representative algorithm · RCPSP-90 | runtime (s): 514 -> 3,210 | Hurt |
| increase k from 1 to 5 | k-representative algorithm · SC(n=1,000) | # iterations: 17 -> 15 | No clear effect |
| solve linear relaxation instead of integer program (ablation) | k-representative algorithm (k=5) · SC(n=1,000) | runtime (s): 264 -> 7 | Improved |
| solve linear relaxation instead of integer program (ablation) | k-representative algorithm (k=5) · RCPSP-90 | runtime (s): 3,210 -> 1,036 | Improved |
Closest papers by meaning
- A Many-Objective Problem Where Crossover Is Provably Indispensable (AAAI 2025 · similarity 0.86)
- How to Find the Exact Pareto Front for Multi-Objective MDPs? (ICLR 2025 · similarity 0.85)
- Runtime Analysis of the SMS-EMOA for Many-Objective Optimization (AAAI 2024 · similarity 0.85)
- Speeding Up the NSGA-II with a Simple Tie-Breaking Rule (AAAI 2025 · similarity 0.85)
- Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms (AAAI 2024 · similarity 0.85)
- Preference Optimization on Pareto Sets: On a Theory of Multi-Objective Optimization (NeurIPS 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
