{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":3,"rows_per_page":100,"shown":100,"of":254,"of_with_code":91,"tagged_in_all":254,"counts":{"archive_papers_tagged":254,"with_a_code_link":91,"where_syntology_ran_a_sample":27,"not_listed_spam_title":0,"listed":254,"listed_where_code_ran":27,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":24,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":24,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/neural-combinatorial-optimization-with","slug":"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":14,"n_constructed":0,"n_ran_checked":10,"n_instrument":4,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":7,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/neural-combinatorial-optimization-with#ran","syntology_url":"https://syntology.ai/paper/1611.09940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.09940"}},"official":null}},{"url":"/paper/differentiation-of-blackbox-combinatorial-1","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-example-of-evolutionary-computation-large#ran","syntology_url":"https://syntology.ai/paper/2401.02051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.02051"}},"official":{"repos":["feiliu36/eoh"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/triplet-interaction-improves-graph","slug":"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_constructed":1,"n_ran_checked":2,"n_instrument":8,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/triplet-interaction-improves-graph#ran","syntology_url":"https://syntology.ai/paper/2402.04538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04538"}},"official":{"repos":["shamim-hussain/tgt"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/rl4co-an-extensive-reinforcement-learning-for","slug":"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":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":3,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rl4co-an-extensive-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/2306.17100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.17100"}},"official":{"repos":["ai4co/rl4co","pytorch/rl"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-to-solve-combinatorial-optimization-1","slug":"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_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-solve-combinatorial-optimization-1#ran","syntology_url":"https://syntology.ai/paper/2409.04495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.04495"}},"official":{"repos":["thinklab-sjtu/nar-co-solver"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/solving-np-hard-min-max-routing-problems-as","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-np-hard-min-max-routing-problems-as#ran","syntology_url":"https://syntology.ai/paper/2306.02689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02689"}},"official":{"repos":["kaist-silab/equity-transformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pointerformer-deep-reinforced-multi-pointer","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pointerformer-deep-reinforced-multi-pointer#ran","syntology_url":"https://syntology.ai/paper/2304.09407","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.09407"}},"official":{"repos":["Learning4Optimization-HUST/Pointerformer"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/gradient-backpropagation-through","slug":"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","slug":"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_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/learning-to-iteratively-solve-routing#ran","syntology_url":"https://syntology.ai/paper/2110.02544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02544"}},"official":{"repos":["yining043/VRP-DACT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/local-search-is-state-of-the-art-for-nas","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/local-search-is-state-of-the-art-for-nas#ran","syntology_url":"https://syntology.ai/paper/2005.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02960"}},"official":{"repos":["naszilla/naszilla","realityengines/local_search"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/combinatorial-optimization-by-graph-pointer","slug":"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":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combinatorial-optimization-by-graph-pointer#ran","syntology_url":"https://syntology.ai/paper/1911.04936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.04936"}},"official":{"repos":["qiang-ma/graph-pointer-network"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/190409352","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/destroy-and-repair-using-hyper-graphs-for#ran","syntology_url":"https://syntology.ai/paper/2502.16170","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.16170"}},"official":{"repos":["ciam-group/drhg"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/blackout-difusco","slug":"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","slug":"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":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-efficient-diffusion-based-non#ran","syntology_url":"https://syntology.ai/paper/2501.13767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.13767"}},"official":{"repos":["deitsp/deitsp"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dualopt-a-dual-divide-and-optimize-algorithm","slug":"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","slug":"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","slug":"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/general-task-optimal-planning-for","slug":"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/learning-to-handle-complex-constraints-for","slug":"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":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-to-handle-complex-constraints-for#ran","syntology_url":"https://syntology.ai/paper/2410.21066","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.21066"}},"official":{"repos":["jieyibi/pip-constraint"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-solver-selection-for-combinatorial","slug":"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_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/neural-solver-selection-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2410.09693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09693"}},"official":{"repos":["lamda-bbo/neural-solver-selection"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-great-architecture-for-edge-based-graph","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-great-architecture-for-edge-based-graph#ran","syntology_url":"https://syntology.ai/paper/2408.16717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16717"}},"official":{"repos":["attila-lischka/GREAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-reasoning-and-multi-agent-approach-in","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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},{"url":"/paper/self-improvement-for-neural-combinatorial","slug":"self-improvement-for-neural-combinatorial","title":"Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvement","date":"2024-03-22","arxiv_id":"2403.15180","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":2,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 2 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-improvement-for-neural-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2403.15180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15180"}},"official":{"repos":["grimmlab/gumbeldore"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/from-words-to-routes-applying-large-language","slug":"from-words-to-routes-applying-large-language","title":"Can Large Language Models Solve Robot Routing?","date":"2024-03-16","arxiv_id":"2403.10795","repositories_listed":1,"syntology":null},{"url":"/paper/ant-colony-optimization-for-cooperative","slug":"ant-colony-optimization-for-cooperative","title":"Ant Colony Optimization for Cooperative Inspection Path Planning Using Multiple Unmanned Aerial Vehicles","date":"2024-02-13","arxiv_id":"2402.08246","repositories_listed":1,"syntology":null},{"url":"/paper/moco-a-learnable-meta-optimizer-for","slug":"moco-a-learnable-meta-optimizer-for","title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","date":"2024-02-07","arxiv_id":"2402.04915","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/moco-a-learnable-meta-optimizer-for#ran","syntology_url":"https://syntology.ai/paper/2402.04915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04915"}},"official":{"repos":["timd3/moco"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/self-labeling-the-job-shop-scheduling-problem","slug":"self-labeling-the-job-shop-scheduling-problem","title":"Self-Labeling the Job Shop Scheduling Problem","date":"2024-01-22","arxiv_id":"2401.11849","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/self-labeling-the-job-shop-scheduling-problem#ran","syntology_url":"https://syntology.ai/paper/2401.11849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11849"}},"official":{"repos":["andreacorsini1/selflabelingjobshop"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/machine-learning-enhanced-aircraft-landing","slug":"machine-learning-enhanced-aircraft-landing","title":"Machine Learning-Enhanced Aircraft Landing Scheduling under Uncertainties","date":"2023-11-27","arxiv_id":"2311.16030","repositories_listed":1,"syntology":null},{"url":"/paper/graph-sparsifications-using-neural-network","slug":"graph-sparsifications-using-neural-network","title":"Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search","date":"2023-11-17","arxiv_id":"2311.10316","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-search-feasible-and-infeasible-1","slug":"learning-to-search-feasible-and-infeasible-1","title":"Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt","date":"2023-10-27","arxiv_id":"2310.18264","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/learning-to-search-feasible-and-infeasible-1#ran","syntology_url":"https://syntology.ai/paper/2310.18264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18264"}},"official":{"repos":["yining043/neuopt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-attention-based-deep-reinforcement","slug":"graph-attention-based-deep-reinforcement","title":"Graph Attention-based Deep Reinforcement Learning for solving the Chinese Postman Problem with Load-dependent costs","date":"2023-10-24","arxiv_id":"2310.15516","repositories_listed":1,"syntology":null},{"url":"/paper/an-improved-artificial-fish-swarm-algorithm","slug":"an-improved-artificial-fish-swarm-algorithm","title":"An Improved Artificial Fish Swarm Algorithm for Solving the Problem of Investigation Path Planning","date":"2023-10-20","arxiv_id":"2310.13375","repositories_listed":1,"syntology":null},{"url":"/paper/on-solving-close-enough-orienteering-problem","slug":"on-solving-close-enough-orienteering-problem","title":"On Solving Close Enough Orienteering Problems with Overlapped Neighborhoods","date":"2023-10-06","arxiv_id":"2310.04257","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-based-non","slug":"reinforcement-learning-based-non","title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems","date":"2023-08-01","arxiv_id":"2308.00560","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reinforcement-learning-based-non#ran","syntology_url":"https://syntology.ai/paper/2308.00560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.00560"}},"official":{"repos":["xybfight/nar4tsp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fis-one-floor-identification-system-with-one","slug":"fis-one-floor-identification-system-with-one","title":"FIS-ONE: Floor Identification System with One Label for Crowdsourced RF Signals","date":"2023-07-12","arxiv_id":"2307.05914","repositories_listed":1,"syntology":null},{"url":"/paper/policy-based-self-competition-for-planning","slug":"policy-based-self-competition-for-planning","title":"Policy-Based Self-Competition for Planning Problems","date":"2023-06-07","arxiv_id":"2306.04403","repositories_listed":1,"syntology":null},{"url":"/paper/towards-omni-generalizable-neural-methods-for","slug":"towards-omni-generalizable-neural-methods-for","title":"Towards Omni-generalizable Neural Methods for Vehicle Routing Problems","date":"2023-05-31","arxiv_id":"2305.19587","repositories_listed":1,"syntology":{"n":22,"n_ran":13,"n_constructed":3,"n_ran_checked":8,"n_instrument":5,"n_unverified":9,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"13 ran (of which 3 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/towards-omni-generalizable-neural-methods-for#ran","syntology_url":"https://syntology.ai/paper/2305.19587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19587"}},"official":{"repos":["royalskye/omni-vrp"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":3,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/nearly-optimal-steiner-trees-using-graph","slug":"nearly-optimal-steiner-trees-using-graph","title":"Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search","date":"2023-04-30","arxiv_id":"2305.00535","repositories_listed":1,"syntology":null},{"url":"/paper/solving-dynamic-traveling-salesman-problems","slug":"solving-dynamic-traveling-salesman-problems","title":"Solving Dynamic Traveling Salesman Problems With Deep Reinforcement Learning","date":"2023-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/preference-aware-delivery-planning-for-last","slug":"preference-aware-delivery-planning-for-last","title":"Preference-Aware Delivery Planning for Last-Mile Logistics","date":"2023-03-08","arxiv_id":"2303.04333","repositories_listed":1,"syntology":null},{"url":"/paper/asp-learn-a-universal-neural-solver","slug":"asp-learn-a-universal-neural-solver","title":"ASP: Learn a Universal Neural Solver!","date":"2023-03-01","arxiv_id":"2303.00466","repositories_listed":1,"syntology":null},{"url":"/paper/difusco-graph-based-diffusion-solvers-for-1","slug":"difusco-graph-based-diffusion-solvers-for-1","title":"DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization","date":"2023-02-16","arxiv_id":"2302.08224","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/difusco-graph-based-diffusion-solvers-for-1#ran","syntology_url":"https://syntology.ai/paper/2302.08224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08224"}},"official":{"repos":["edward-sun/difusco"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/travel-the-same-path-a-novel-tsp-solving","slug":"travel-the-same-path-a-novel-tsp-solving","title":"Travel the Same Path: A Novel TSP Solving Strategy","date":"2022-10-12","arxiv_id":"2210.05906","repositories_listed":1,"syntology":null},{"url":"/paper/dimes-a-differentiable-meta-solver-for","slug":"dimes-a-differentiable-meta-solver-for","title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","date":"2022-10-08","arxiv_id":"2210.04123","repositories_listed":1,"syntology":{"n":25,"n_ran":10,"n_constructed":1,"n_ran_checked":1,"n_instrument":9,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 9 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/dimes-a-differentiable-meta-solver-for#ran","syntology_url":"https://syntology.ai/paper/2210.04123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.04123"}},"official":{"repos":["dimesteam/dimes"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":15,"ran_from_kinds":["official"]}}},{"url":"/paper/supplementing-recurrent-neural-networks-with","slug":"supplementing-recurrent-neural-networks-with","title":"Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems","date":"2022-07-17","arxiv_id":"2207.08189","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supplementing-recurrent-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2207.08189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.08189"}},"official":{"repos":["rnn-vca-co/rnn-vca-co"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforced-lin-kernighan-helsgaun-algorithms","slug":"reinforced-lin-kernighan-helsgaun-algorithms","title":"Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems","date":"2022-07-08","arxiv_id":"2207.03876","repositories_listed":1,"syntology":null},{"url":"/paper/neural-improvement-heuristics-for-preference","slug":"neural-improvement-heuristics-for-preference","title":"Neural Improvement Heuristics for Graph Combinatorial Optimization Problems","date":"2022-06-01","arxiv_id":"2206.00383","repositories_listed":1,"syntology":null},{"url":"/paper/sym-nco-leveraging-symmetricity-for-neural","slug":"sym-nco-leveraging-symmetricity-for-neural","title":"Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization","date":"2022-05-26","arxiv_id":"2205.13209","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/sym-nco-leveraging-symmetricity-for-neural#ran","syntology_url":"https://syntology.ai/paper/2205.13209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13209"}},"official":{"repos":["alstn12088/sym-nco"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/word-tour-one-dimensional-word-embeddings-via","slug":"word-tour-one-dimensional-word-embeddings-via","title":"Word Tour: One-dimensional Word Embeddings via the Traveling Salesman Problem","date":"2022-05-04","arxiv_id":"2205.01954","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/word-tour-one-dimensional-word-embeddings-via#ran","syntology_url":"https://syntology.ai/paper/2205.01954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01954"}},"official":{"repos":["joisino/wordtour"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/distance-approximation-to-support-customer","slug":"distance-approximation-to-support-customer","title":"Distance approximation to support customer selection in vehicle routing problems","date":"2022-04-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pareto-set-learning-for-neural-multi","slug":"pareto-set-learning-for-neural-multi","title":"Pareto Set Learning for Neural Multi-objective Combinatorial Optimization","date":"2022-03-29","arxiv_id":"2203.15386","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/pareto-set-learning-for-neural-multi#ran","syntology_url":"https://syntology.ai/paper/2203.15386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15386"}},"official":{"repos":["xi-l/pmoco"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/improving-ant-colony-optimization-efficiency","slug":"improving-ant-colony-optimization-efficiency","title":"Improving Ant Colony Optimization Efficiency for Solving Large TSP Instances","date":"2022-03-04","arxiv_id":"2203.02228","repositories_listed":1,"syntology":null},{"url":"/paper/combining-reinforcement-learning-and-optimal","slug":"combining-reinforcement-learning-and-optimal","title":"Combining Reinforcement Learning and Optimal Transport for the Traveling Salesman Problem","date":"2022-03-02","arxiv_id":"2203.00903","repositories_listed":1,"syntology":null},{"url":"/paper/the-first-ai4tsp-competition-learning-to","slug":"the-first-ai4tsp-competition-learning-to","title":"The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems","date":"2022-01-25","arxiv_id":"2201.10453","repositories_listed":1,"syntology":null},{"url":"/paper/solving-dynamic-graph-problems-with-multi","slug":"solving-dynamic-graph-problems-with-multi","title":"Solving Dynamic Graph Problems with Multi-Attention Deep Reinforcement Learning","date":"2022-01-13","arxiv_id":"2201.04895","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-reinforcement-learning-approach-for-11","slug":"a-deep-reinforcement-learning-approach-for-11","title":"A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone","date":"2021-12-22","arxiv_id":"2112.12545","repositories_listed":1,"syntology":null},{"url":"/paper/enhanced-self-organizing-map-solution-for-the","slug":"enhanced-self-organizing-map-solution-for-the","title":"Enhanced Self-Organizing Map Solution for the Traveling Salesman Problem","date":"2021-12-03","arxiv_id":"2201.07208","repositories_listed":1,"syntology":null},{"url":"/paper/learning-collaborative-policies-to-solve-np","slug":"learning-collaborative-policies-to-solve-np","title":"Learning Collaborative Policies to Solve NP-hard Routing Problems","date":"2021-10-26","arxiv_id":"2110.13987","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":4,"n_ran_checked":4,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":11,"phrase":"6 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-collaborative-policies-to-solve-np#ran","syntology_url":"https://syntology.ai/paper/2110.13987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13987"}},"official":{"repos":["alstn12088/lcp"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/neurolkh-combining-deep-learning-model-with","slug":"neurolkh-combining-deep-learning-model-with","title":"NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem","date":"2021-10-15","arxiv_id":"2110.07983","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":4,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"6 ran (of which 4 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neurolkh-combining-deep-learning-model-with#ran","syntology_url":"https://syntology.ai/paper/2110.07983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.07983"}},"official":{"repos":["liangxinedu/neurolkh"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":4,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hybrid-pointer-networks-for-traveling","slug":"hybrid-pointer-networks-for-traveling","title":"Hybrid Pointer Networks for Traveling Salesman Problems Optimization","date":"2021-10-06","arxiv_id":"2110.03104","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-constructive-heuristic-driven-by","slug":"a-new-constructive-heuristic-driven-by","title":"A New Constructive Heuristic driven by Machine Learning for the Traveling Salesman Problem","date":"2021-08-17","arxiv_id":"2108.10224","repositories_listed":1,"syntology":null},{"url":"/paper/formulating-neural-sentence-ordering-as-the","slug":"formulating-neural-sentence-ordering-as-the","title":"Formulating Neural Sentence Ordering as the Asymmetric Traveling Salesman Problem","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/exact-and-heuristic-approaches-to-drone","slug":"exact-and-heuristic-approaches-to-drone","title":"Exact and Heuristic Approaches to Drone Delivery Problems","date":"2021-07-29","arxiv_id":"2108.01996","repositories_listed":1,"syntology":null},{"url":"/paper/learning-delaunay-triangulation-using-self","slug":"learning-delaunay-triangulation-using-self","title":"Learning Geometric Combinatorial Optimization Problems using Self-attention and Domain Knowledge","date":"2021-07-05","arxiv_id":"2107.01759","repositories_listed":1,"syntology":null},{"url":"/paper/solve-routing-problems-with-a-residual-edge","slug":"solve-routing-problems-with-a-residual-edge","title":"Solve routing problems with a residual edge-graph attention neural network","date":"2021-05-06","arxiv_id":"2105.02730","repositories_listed":1,"syntology":null},{"url":"/paper/s-a-heuristic-information-based-approximation","slug":"s-a-heuristic-information-based-approximation","title":"S$^*$: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding","date":"2021-03-15","arxiv_id":"2103.08155","repositories_listed":1,"syntology":null},{"url":"/paper/the-transformer-network-for-the-traveling","slug":"the-transformer-network-for-the-traveling","title":"The Transformer Network for the Traveling Salesman Problem","date":"2021-03-04","arxiv_id":"2103.03012","repositories_listed":1,"syntology":null},{"url":"/paper/generalize-a-small-pre-trained-model-to","slug":"generalize-a-small-pre-trained-model-to","title":"Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances","date":"2020-12-19","arxiv_id":"2012.10658","repositories_listed":1,"syntology":null},{"url":"/paper/combining-reinforcement-learning-with-lin","slug":"combining-reinforcement-learning-with-lin","title":"Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem","date":"2020-12-08","arxiv_id":"2012.04461","repositories_listed":1,"syntology":null},{"url":"/paper/cable-tree-wiring-benchmarking-solvers-on-a","slug":"cable-tree-wiring-benchmarking-solvers-on-a","title":"Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints","date":"2020-11-25","arxiv_id":"2011.12862","repositories_listed":1,"syntology":null},{"url":"/paper/combining-reinforcement-learning-and-1","slug":"combining-reinforcement-learning-and-1","title":"Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization","date":"2020-06-02","arxiv_id":"2006.01610","repositories_listed":1,"syntology":null},{"url":"/paper/learning-2-opt-heuristics-for-the-traveling","slug":"learning-2-opt-heuristics-for-the-traveling","title":"Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learning","date":"2020-04-03","arxiv_id":"2004.01608","repositories_listed":1,"syntology":null},{"url":"/paper/a-non-dominated-sorting-based-customized","slug":"a-non-dominated-sorting-based-customized","title":"A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem","date":"2020-02-11","arxiv_id":"2002.04303","repositories_listed":1,"syntology":null},{"url":"/paper/implementing-a-gpu-based-parallel-max-min-ant","slug":"implementing-a-gpu-based-parallel-max-min-ant","title":"Implementing a GPU-based parallel MAX-MIN Ant System","date":"2020-01-18","arxiv_id":"2003.11902","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-genetic-algorithm-for-the-traveling","slug":"a-hybrid-genetic-algorithm-for-the-traveling","title":"A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone","date":"2018-12-21","arxiv_id":"1812.09351","repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-clustered-traveling-salesman","slug":"solving-the-clustered-traveling-salesman","title":"Solving the clustered traveling salesman problem with d-relaxed priority rule","date":"2018-10-06","arxiv_id":"1810.03981","repositories_listed":1,"syntology":null},{"url":"/paper/improving-tsp-solutions-using-ga-with-a-new","slug":"improving-tsp-solutions-using-ga-with-a-new","title":"Improving TSP Solutions Using GA with a New Hybrid Mutation Based on Knowledge and Randomness","date":"2018-01-22","arxiv_id":"1801.07233","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-align-the-source-code-to-the","slug":"learning-to-align-the-source-code-to-the","title":"Learning to Align the Source Code to the Compiled Object Code","date":"2017-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-analysis-of-approximation","slug":"an-empirical-analysis-of-approximation","title":"An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem","date":"2017-05-25","arxiv_id":"1705.09058","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-min-cost-traveling-salesman-problem","slug":"on-the-min-cost-traveling-salesman-problem","title":"On the Min-cost Traveling Salesman Problem with Drone","date":"2015-09-29","arxiv_id":"1509.08764","repositories_listed":1,"syntology":null},{"url":"/paper/evolving-tsp-heuristics-using-multi","slug":"evolving-tsp-heuristics-using-multi","title":"Evolving TSP heuristics using Multi Expression Programming","date":"2015-09-08","arxiv_id":"1509.02459","repositories_listed":1,"syntology":null},{"url":"/paper/a-powerful-genetic-algorithm-for-traveling","slug":"a-powerful-genetic-algorithm-for-traveling","title":"A Powerful Genetic Algorithm for Traveling Salesman Problem","date":"2014-02-19","arxiv_id":"1402.4699","repositories_listed":1,"syntology":null},{"url":"/paper/12033097","slug":"12033097","title":"A Comparative Study of Adaptive Crossover Operators for Genetic Algorithms to Resolve the Traveling Salesman Problem","date":"2012-03-14","arxiv_id":"1203.3097","repositories_listed":1,"syntology":null},{"url":null,"slug":"multimodal-fused-learning-for-solving-the","title":"Multimodal Fused Learning for Solving the Generalized Traveling Salesman Problem in Robotic Task Planning","date":"2025-06-20","arxiv_id":"2506.16931","repositories_listed":0,"syntology":null},{"url":null,"slug":"rsgcn-rescaling-enhances-generalization-of","title":"RsGCN: Rescaling Enhances Generalization of GCNs for Solving Scalable Traveling Salesman Problems","date":"2025-05-31","arxiv_id":"2506.00533","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-for-dynamic-combinatorial","title":"Learning for Dynamic Combinatorial Optimization without Training Data","date":"2025-05-26","arxiv_id":"2505.19497","repositories_listed":0,"syntology":null},{"url":null,"slug":"lmask-learn-to-solve-constrained-routing","title":"LMask: Learn to Solve Constrained Routing Problems with Lazy Masking","date":"2025-05-23","arxiv_id":"2505.17938","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-based-dynamic-candidate-edge-selection","title":"Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems","date":"2025-05-21","arxiv_id":"2505.15862","repositories_listed":0,"syntology":null},{"url":null,"slug":"preference-optimization-for-combinatorial","title":"Preference Optimization for Combinatorial Optimization Problems","date":"2025-05-13","arxiv_id":"2505.08735","repositories_listed":0,"syntology":null},{"url":null,"slug":"purity-law-for-generalizable-neural-tsp","title":"Purity Law for Generalizable Neural TSP Solvers","date":"2025-05-07","arxiv_id":"2505.04558","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-iterative-chainlet-partitioning-algorithm","title":"The Iterative Chainlet Partitioning Algorithm for the Traveling Salesman Problem with Drone and Neural Acceleration","date":"2025-04-21","arxiv_id":"2504.15147","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-as-particle-swarm","title":"Large Language Models as Particle Swarm Optimizers","date":"2025-04-12","arxiv_id":"2504.09247","repositories_listed":0,"syntology":null}],"syntology_records":29,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":27,"papers_where_code_ran_first_page":"/task/traveling-salesman-problem/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":3,"url":"/task/traveling-salesman-problem/papers/2","json":"/task/traveling-salesman-problem/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/traveling-salesman-problem/papers/3","json":"/task/traveling-salesman-problem/papers/3.json","rows":54},{"order":"ran","page":1,"of":1,"url":"/task/traveling-salesman-problem/papers/ran/1","json":"/task/traveling-salesman-problem/papers/ran/1.json","rows":27}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"faacd3d3937a5ced1953d8356ead1fcec3d70a0e9cf1f0593829147ed36bbd14","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}