Research map / Learning theory and algorithms / Combinatorial and search optimization
Enhancing Constraint-Based Multi-Objective Combinatorial Optimization
Miguel Terra-Neves, Inês Lynce, Vasco Manquinho
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 |
|---|---|---|---|
| handle wastage with division reduction instead of discarding denominators (ablation) | CLD · VMC (Google traces, 8 servers) | HV and IGD | Improved |
| handle wastage with division reduction (ablation) | CLD · VMC (Google traces, 8 servers) | best wastage cost | Improved |
| lower migration budget (5%, 1%, 0.5%) for division reduction (ablation) | CLD · VMC (Google traces, 8 servers) | HV and best wastage | Hurt |
| add SampleMCS diversification (ablation) | CLD · VMC, bp=100% | IGD | Hurt |
| add SampleMCS diversification (ablation) | CLD · VMC, bp=100% | HV | No clear effect |
| add MCSEnumPD path diversification (ablation) | CLD · VMC, bp=100% | HV | Improved |
| add MCSEnumPD path diversification (ablation) | CLD · VMC, bp=100% | IGD | Mixed |
| lower migration budget to 5%/1% with MCSEnumPD (ablation) | MCSEnumPD · VMC, bp=5%/1% | HV | Hurt |
| add SampleMCS under 5% budget (ablation) | CLD · VMC, bp=5% | feasible instances found | Improved |
| VMPMBBO vs CLD variants | MCSEnumPD · VMC, bp=100% | HV and IGD | Hurt |
| MCSEnumPD vs MGGA | MCSEnumPD · VMC, bp=100% | HV | Improved |
| tighten migration budget to 5% and 1% | VMPMBBO and MGGA · VMC | HV and IGD | Hurt |
Closest papers by meaning
- Balanced Adaptive Subspace Collaboration for Mixed Pareto-Lexicographic Multi-Objective Problems with Priority Levels (AAAI 2025 · similarity 0.83)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.81)
- Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More (ICML 2024 · similarity 0.81)
- Gliding over the Pareto Front with Uniform Designs (NeurIPS 2024 · similarity 0.81)
- Few for Many: Tchebycheff Set Scalarization for Many-Objective Optimization (ICLR 2025 · similarity 0.81)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.81)
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.
