{"url":"/task/traveling-salesman-problem","name":"Traveling Salesman Problem","slug":"traveling-salesman-problem","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":254,"papers_with_code":91,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/tsp-hcp-benchmark-set","name":"TSP/HCP Benchmark set","full_name":"","num_papers_in_archive":5}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":91,"tagged_in_all":254,"items":[{"url":"/paper/neural-combinatorial-optimization-with","title":"Neural Combinatorial Optimization with Reinforcement Learning","date":"2016-11-29","arxiv_id":"1611.09940","repositories_listed":10,"syntology":{"n":20,"n_ran":6,"n_unverified":14,"n_pointer_only":5}},{"url":"/paper/differentiation-of-blackbox-combinatorial-1","title":"Differentiation of Blackbox Combinatorial Solvers","date":"2019-12-04","arxiv_id":"1912.02175","repositories_listed":7,"syntology":null},{"url":"/paper/an-example-of-evolutionary-computation-large","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","date":"2024-01-04","arxiv_id":"2401.02051","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","arxiv_id":"2402.04538","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/rl4co-an-extensive-reinforcement-learning-for","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","date":"2023-06-29","arxiv_id":"2306.17100","repositories_listed":3,"syntology":{"n":16,"n_ran":0,"n_unverified":16,"n_pointer_only":3}},{"url":"/paper/learning-to-solve-combinatorial-optimization-1","title":"Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks","date":"2024-09-06","arxiv_id":"2409.04495","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":7}},{"url":"/paper/solving-np-hard-min-max-routing-problems-as","title":"Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context","date":"2023-06-05","arxiv_id":"2306.02689","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/pointerformer-deep-reinforced-multi-pointer","title":"Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem","date":"2023-04-19","arxiv_id":"2304.09407","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_unverified":1,"n_pointer_only":3}},{"url":"/paper/gradient-backpropagation-through","title":"Backpropagation through Combinatorial Algorithms: Identity with Projection Works","date":"2022-05-30","arxiv_id":"2205.15213","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-iteratively-solve-routing","title":"Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer","date":"2021-10-06","arxiv_id":"2110.02544","repositories_listed":2,"syntology":{"n":16,"n_ran":9,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/local-search-is-state-of-the-art-for-nas","title":"Exploring the Loss Landscape in Neural Architecture Search","date":"2020-05-06","arxiv_id":"2005.02960","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/combinatorial-optimization-by-graph-pointer","title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning","date":"2019-11-12","arxiv_id":"1911.04936","repositories_listed":2,"syntology":{"n":9,"n_ran":0,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/190409352","title":"Donkey and Smuggler Optimization Algorithm: A Collaborative Working Approach to Path Finding","date":"2019-04-19","arxiv_id":"1904.09352","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-problem-solving-in-an","title":"Collaborative Problem-Solving in an Optimization Game","date":"2025-05-21","arxiv_id":"2505.15490","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-large-language-models-to-develop","title":"Leveraging Large Language Models to Develop Heuristics for Emerging Optimization Problems","date":"2025-03-05","arxiv_id":"2503.03350","repositories_listed":1,"syntology":null},{"url":"/paper/destroy-and-repair-using-hyper-graphs-for","title":"Destroy and Repair Using Hyper Graphs for Routing","date":"2025-02-22","arxiv_id":"2502.16170","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_unverified":3,"n_pointer_only":5}},{"url":"/paper/blackout-difusco","title":"Blackout DIFUSCO","date":"2025-02-05","arxiv_id":"2502.05221","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-diffusion-based-non","title":"An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem","date":"2025-01-23","arxiv_id":"2501.13767","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/dualopt-a-dual-divide-and-optimize-algorithm","title":"DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem","date":"2025-01-15","arxiv_id":"2501.08565","repositories_listed":1,"syntology":null},{"url":"/paper/elena-epigenetic-learning-through-evolved","title":"ELENA: Epigenetic Learning through Evolved Neural Adaptation","date":"2025-01-10","arxiv_id":"2501.05735","repositories_listed":1,"syntology":null},{"url":"/paper/multi-armed-bandit-and-backbone-boost-lin","title":"Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems","date":"2025-01-07","arxiv_id":"2501.04072","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-handle-complex-constraints-for","title":"Learning to Handle Complex Constraints for Vehicle Routing Problems","date":"2024-10-28","arxiv_id":"2410.21066","repositories_listed":1,"syntology":{"n":12,"n_ran":2,"n_unverified":10,"n_pointer_only":0}},{"url":"/paper/general-task-optimal-planning-for","title":"Optimal planning for heterogeneous autonomous teams with precedence and compatibility constraints and its application on power grid inspection with Unmanned Aerial Vehicles","date":"2024-10-28","arxiv_id":"2410.20849","repositories_listed":1,"syntology":null},{"url":"/paper/neural-solver-selection-for-combinatorial","title":"Neural Solver Selection for Combinatorial Optimization","date":"2024-10-13","arxiv_id":"2410.09693","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/a-great-architecture-for-edge-based-graph","title":"A GREAT Architecture for Edge-Based Graph Problems Like TSP","date":"2024-08-29","arxiv_id":"2408.16717","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/visual-reasoning-and-multi-agent-approach-in","title":"Visual Reasoning and Multi-Agent Approach in Multimodal Large Language Models (MLLMs): Solving TSP and mTSP Combinatorial Challenges","date":"2024-06-26","arxiv_id":"2407.00092","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutional-branch-and-bound","title":"Graph Convolutional Branch and Bound","date":"2024-06-05","arxiv_id":"2406.03099","repositories_listed":1,"syntology":null},{"url":"/paper/cycleformer-tsp-solver-based-on-language","title":"CycleFormer : TSP Solver Based on Language Modeling","date":"2024-05-30","arxiv_id":"2405.20042","repositories_listed":1,"syntology":null},{"url":"/paper/a-random-key-grasp-for-combinatorial","title":"A random-key GRASP for combinatorial optimization","date":"2024-05-29","arxiv_id":"2405.18681","repositories_listed":1,"syntology":null},{"url":"/paper/imtsp-solving-min-max-multiple-traveling","title":"iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning","date":"2024-05-01","arxiv_id":"2405.00285","repositories_listed":1,"syntology":null}],"syntology_records":15,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}