Research map / Learning theory and algorithms / Combinatorial and search optimization
Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD)
Alessandro Bertagnon, Marco Gavanelli
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 geometric filtering to BvHRRR (lkh lcfirst) (ablation) | BvHRRR · eil76 | solving time: 72.56 -> 33.20 | Improved |
| add geometric filtering to BvHRRR (lkh lcfirst) (ablation) | BvHRRR · st70 | solving time: 1411.63 -> 327.79 | Improved |
| add geometric filtering to BvHRRR (lkh lcfirst) (ablation) | BvHRRR · eil51 | solving time: T/O -> 523.92 | Improved |
| add geometric filtering to BvHRRR (lkh maxregret) (ablation) | BvHRRR · eil51 | solving time: 313.53 -> 84.43 | Improved |
| add geometric filtering to BvHRRR (lkh maxregret) (ablation) | BvHRRR · rat99 | solving time: T/O -> 436.97 | Improved |
| add geometric filtering to BvHRRR (lkh maxregret) (ablation) | BvHRRR · att48 | solving time: 8.02 -> 3.10 | Improved |
| add geometric filtering to BvHRRR (lkh maxregret) (ablation) | BvHRRR · eil76 | solving time: 160.09 -> 31.80 | Improved |
| add geometric filtering to BvHRRR (lkh lcfirst) (ablation) | BvHRRR · dj38 | solving time: 0.42 -> 0.65 | Hurt |
| add geometric filtering to BvHRRR (lkh lcfirst) (ablation) | BvHRRR · berlin52 and other easy instances | solving time: 0.86 -> 1.67 | Hurt |
| add geometric filtering to BvHRRR (lkh maxregret) (ablation) | BvHRRR · st70 | solving time | No clear effect |
| add geometric filtering to simple CLP(FD) and BvHRRR (ablation) | CLP(FD) and BvHRRR · random Euclidean TSP, 20-50 nodes | runtime | Improved |
| add geometric filtering with LKH bound (ablation) | search strategies · random Euclidean TSP | instances solved | Improved |
Closest papers by meaning
- Graph Neural Network Guided Local Search for the Traveling Salesperson Problem (ICLR 2022 · similarity 0.86)
- TSP with Predictions: Heatmap to Tour with Provable Guarantees (ICML 2026 · similarity 0.86)
- Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW (AAAI 2016 · similarity 0.86)
- Learning to Solve NP-Complete Problems: A Graph Neural Network for Decision TSP (AAAI 2019 · similarity 0.85)
- DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem (AAAI 2025 · similarity 0.83)
- Parallel Beam Search Algorithms for Domain-Independent Dynamic Programming (AAAI 2024 · 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.
