Skip to content
conftrace_

traveling salesman problem

71 papers

TSP

Papers

A TSP-Based Algorithm for Multi-League Traveling Tournament AAAI 2026 Boosting Cross-problem Generalization in Diffusion-Based Neural Combinatorial Solver via Inference Time Adaptation AAAI 2026 Efficient Few-Step Solution Generation via Discrete Flow Matching for Combinatorial Optimization AAAI 2026 FPT Approximation Algorithms for TSP on Non-Metric Graphs AAAI 2026 GHOST: Solving the Traveling Salesman Problem on Graphs of Convex Sets AAAI 2026 Optimization of Multi-Agent Flying Sidekick Traveling Salesman Problem over Road Networks AAAI 2026 BOPO: Neural Combinatorial Optimization via Best-anchored and Objective-guided Preference Optimization ICML 2025 Destroy and Repair Using Hyper-Graphs for Routing AAAI 2025 DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem AAAI 2025 EFormer: An Effective Edge-based Transformer for Vehicle Routing Problems IJCAI 2025 GraphArena: Evaluating and Exploring Large Language Models on Graph Computation ICLR 2025 Improved Approximation Algorithms for Clustered TSP and Subgroup Planning AAAI 2025 Neural Solver Selection for Combinatorial Optimization ICML 2025 Preference Optimization for Combinatorial Optimization Problems ICML 2025 Scaling Combinatorial Optimization Neural Improvement Heuristics with Online Search and Adaptation AAAI 2025 TSP-Mamba: The Travelling Salesman Problem Meets Mamba for Image Super-resolution and Beyond CVPR 2025 UniCO: On Unified Combinatorial Optimization via Problem Reduction to Matrix-Encoded General TSP ICLR 2025 Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization NeurIPS 2024 GLOP: Learning Global Partition and Local Construction for Solving Large-Scale Routing Problems in Real-Time AAAI 2024 Large Language Models as Optimizers ICLR 2024 Learning to Handle Complex Constraints for Vehicle Routing Problems NeurIPS 2024 Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems ICML 2024 Rethinking Deep Thinking: Stable Learning of Algorithms using Lipschitz Constraints NeurIPS 2024 BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization NeurIPS 2023 DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization NeurIPS 2023