Research map / Graph learning / Graph algorithms and clustering
An Adaptive Configuration-Aware Simulated Annealing for the Maximally Diverse Grouping Problem
Baiyu Chen, Canhui Luo, Junwen Ding, Qingyun Zhang, Zhouxing Su, Zhipeng Lü
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 |
|---|---|---|---|
| add vertex-wise sequential coordination of insertion and swap (ablation) | ACSA · MDGP, 120 DGS instances | instances won vs variant: 88 wins, 16 losses on best; 101 wins, 19 losses on average | Improved |
| add relaxation-based insertion (ablation) | ACSA · MDGP, 120 DGS instances | instances won vs variant: 100 wins, 18 losses on best; 106 wins, 14 losses on average | Improved |
| add memory-based swap (ablation) | ACSA · MDGP, 120 DGS instances | instances won vs variant: 89 wins, 8 losses on best; 112 wins, 8 losses on average | Improved |
| add positive-improvement constraint in relaxation-based insertion (ablation) | ACSA · MDGP, 120 DGS instances | instances won vs variant: 54 wins, 41 losses on best; 76 wins, 44 losses on average | Improved |
| ACSA versus FIFR, TPSDP, NDHA on all instances | ACSA · MDGP, 500 instances | instances with best objective: 499 vs 33, 31, 23 | Improved |
| ACSA versus best baseline per instance | ACSA · MDGP, 500 instances | Wilcoxon test: 460 better, 1 worse (best); 493 better, 5 worse (average) | Improved |
Closest papers by meaning
- An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem (AAAI 2025 · similarity 0.88)
- Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem (AAAI 2024 · similarity 0.87)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.84)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.83)
- Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover (AAAI 2024 · similarity 0.83)
- Improved Approximation Algorithms for Clustered TSP and Subgroup Planning (AAAI 2025 · similarity 0.83)
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.
