Research map / Learning theory and algorithms / Combinatorial and search optimization
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| use TSM-MWC instead of MWCLQ and WLMC | TSM-MWC · DIMACS | graphs solved: 66 vs 61 (MWCLQ) and 60 (WLMC) | Helped |
| use TSM-MWC instead of WLMC | TSM-MWC · MASSIVE (47 hard graphs) | graphs solved: 47 vs 30 | Helped |
| use TSM-MWC instead of WLMC on search tree size | TSM-MWC · WDP | mean search tree size (1e5): 6.02 -> 1.92 | Helped |
| use TSM-MWC instead of WLMC on search tree size | TSM-MWC · DIMACS | mean search tree size (1e5): 15.5 -> 60.6 | Hurt |
| add binary MaxSAT reasoning (replace standard IS partition) (ablation) | TSM-MWC · DIMACS | graphs solved: 54 -> 64 | Helped |
| add binary MaxSAT reasoning (replace standard IS partition) (ablation) | TSM-MWC · MASSIVE | graphs solved: 15 -> 34 | Helped |
| add binary MaxSAT reasoning (replace standard IS partition) (ablation) | TSM-MWC · WDP | mean search tree size (1e5): 74.2 -> 6.05 | Helped |
| add ordered MaxSAT reasoning on top of IS partition (ablation) | TSM-MWC · DIMACS | graphs solved: 54 -> 66 | Helped |
| replace brute-force MaxSAT with ordered MaxSAT (ablation) | TSM-MWC · DIMACS | graphs solved: 60 -> 66 | Helped |
| replace brute-force MaxSAT with ordered MaxSAT (ablation) | TSM-MWC · MASSIVE | graphs solved: 30 -> 35 | Helped |
| add binary MaxSAT reasoning (ablation) | TSM-MWC · KES | graphs solved: 80 -> 82 | Helped |
Closest papers by meaning
- Two Efficient Local Search Algorithms for Maximum Weight Clique Problem (AAAI 2016 · similarity 0.89)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.88)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.87)
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.85)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.84)
- An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem (AAAI 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.