{"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/papers/2","list_of":"/task/traveling-salesman-problem","task":"Traveling Salesman Problem","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"of":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"},"first_page":"/task/traveling-salesman-problem","prev":"/task/traveling-salesman-problem","next":"/task/traveling-salesman-problem/papers/3","papers":[{"url":null,"slug":"annealed-mean-field-descent-is-highly","title":"Annealed Mean Field Descent Is Highly Effective for Quadratic Unconstrained Binary Optimization","date":"2025-04-11","arxiv_id":"2504.08315","repositories_listed":0,"syntology":null},{"url":null,"slug":"steiner-traveling-salesman-problem-with","title":"Steiner Traveling Salesman Problem with Quantum Annealing","date":"2025-04-03","arxiv_id":"2504.02388","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-package-delivery-with-quantum","title":"Optimizing Package Delivery with Quantum Annealers: Addressing Time-Windows and Simultaneous Pickup and Delivery","date":"2025-04-02","arxiv_id":"2504.01560","repositories_listed":0,"syntology":null},{"url":null,"slug":"tunensearch-a-hybrid-transfer-learning-and","title":"TuneNSearch: a hybrid transfer learning and local search approach for solving vehicle routing problems","date":"2025-03-16","arxiv_id":"2503.12662","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-pattern-aware-complexity-with-np","title":"Bridging Pattern-Aware Complexity with NP-Hard Optimization: A Unifying Framework and Empirical Study","date":"2025-03-12","arxiv_id":"2506.13810","repositories_listed":0,"syntology":null},{"url":null,"slug":"l2r-learning-to-reduce-search-space-for","title":"Learning to Reduce Search Space for Generalizable Neural Routing Solver","date":"2025-03-05","arxiv_id":"2503.03137","repositories_listed":0,"syntology":null},{"url":null,"slug":"navigating-intelligence-a-survey-of-google-or","title":"Navigating Intelligence: A Survey of Google OR-Tools and Machine Learning for Global Path Planning in Autonomous Vehicles","date":"2025-03-05","arxiv_id":"2503.03338","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-traveling-salesman-problem-via","title":"Solving the Traveling Salesman Problem via Different Quantum Computing Architectures","date":"2025-02-24","arxiv_id":"2502.17725","repositories_listed":0,"syntology":null},{"url":null,"slug":"localescaper-a-weakly-supervised-framework","title":"LocalEscaper: A Weakly-supervised Framework with Regional Reconstruction for Scalable Neural TSP Solvers","date":"2025-02-18","arxiv_id":"2502.12484","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-based-tsp-solvers-tend-to-be-overly","title":"Learning-Based TSP-Solvers Tend to Be Overly Greedy","date":"2025-02-02","arxiv_id":"2502.00767","repositories_listed":0,"syntology":null},{"url":null,"slug":"pso-and-the-traveling-salesman-problem-an","title":"PSO and the Traveling Salesman Problem: An Intelligent Optimization Approach","date":"2025-01-25","arxiv_id":"2501.15319","repositories_listed":0,"syntology":null},{"url":null,"slug":"cascaded-large-scale-tsp-solving-with-unified","title":"Cascaded Large-Scale TSP Solving with Unified Neural Guidance: Bridging Local and Population-based Search","date":"2025-01-24","arxiv_id":"2501.14285","repositories_listed":0,"syntology":null},{"url":null,"slug":"tsp-mamba-the-travelling-salesman-problem","title":"TSP-Mamba: The Travelling Salesman Problem Meets Mamba for Image Super-resolution and Beyond","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ideq-an-improved-diffusion-model-for-the-tsp","title":"IDEQ: an improved diffusion model for the TSP","date":"2024-12-18","arxiv_id":"2412.13858","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-application-of-model-predictive","title":"On the Application of Model Predictive Control to a Weighted Coverage Path Planning Problem","date":"2024-11-13","arxiv_id":"2411.08634","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-sub-image-search-for-variable","title":"Accelerated Sub-Image Search For Variable-Size Patches Identification Based On Virtual Time Series Transformation And Segmentation","date":"2024-10-20","arxiv_id":"2410.15425","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-traveling-bandit-a-framework-for-bayesian","title":"The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs","date":"2024-10-18","arxiv_id":"2410.14533","repositories_listed":0,"syntology":null},{"url":null,"slug":"ic-dc-surpassing-heuristic-solvers-in","title":"Unsupervised Training of Diffusion Models for Feasible Solution Generation in Neural Combinatorial Optimization","date":"2024-10-15","arxiv_id":"2411.00003","repositories_listed":0,"syntology":null},{"url":null,"slug":"d-wave-s-nonlinear-program-hybrid-solver","title":"D-Wave's Nonlinear-Program Hybrid Solver: Description and Performance Analysis","date":"2024-10-10","arxiv_id":"2410.07980","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-evolution-of-heuristic-using","title":"Multi-objective Evolution of Heuristic Using Large Language Model","date":"2024-09-25","arxiv_id":"2409.16867","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-evolutionary-algorithm-for-tsp","title":"Quantum evolutionary algorithm for TSP combinatorial optimisation problem","date":"2024-09-20","arxiv_id":"2409.13788","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-of-multi-agent-flying-sidekick","title":"Optimization of Multi-Agent Flying Sidekick Traveling Salesman Problem over Road Networks","date":"2024-08-20","arxiv_id":"2408.11187","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-neural-constructive-solver-for","title":"Hierarchical Neural Constructive Solver for Real-world TSP Scenarios","date":"2024-08-07","arxiv_id":"2408.03585","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-bit-labeling-in-factorization","title":"Efficient Bit Labeling in Factorization Machines with Annealing for Traveling Salesman Problem","date":"2024-07-02","arxiv_id":"2407.02091","repositories_listed":0,"syntology":null},{"url":null,"slug":"eyeballing-combinatorial-problems-a-case","title":"Eyeballing Combinatorial Problems: A Case Study of Using Multimodal Large Language Models to Solve Traveling Salesman Problems","date":"2024-06-11","arxiv_id":"2406.06865","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-interdiction-goes-neural","title":"Network Interdiction Goes Neural","date":"2024-05-26","arxiv_id":"2405.16409","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-four-prominent-ant","title":"Comparative Analysis of Four Prominent Ant Colony Optimization Variants: Ant System, Rank-Based Ant System, Max-Min Ant System, and Ant Colony System","date":"2024-05-24","arxiv_id":"2405.15397","repositories_listed":0,"syntology":null},{"url":null,"slug":"leader-reward-for-pomo-based-neural","title":"Leader Reward for POMO-Based Neural Combinatorial Optimization","date":"2024-05-22","arxiv_id":"2405.13947","repositories_listed":0,"syntology":null},{"url":null,"slug":"halfway-escape-optimization-a-quantum","title":"Halfway Escape Optimization: A Quantum-Inspired Solution for General Optimization Problems","date":"2024-05-05","arxiv_id":"2405.02850","repositories_listed":0,"syntology":null},{"url":null,"slug":"qoptlib-a-quantum-computing-oriented","title":"QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems","date":"2024-04-24","arxiv_id":"2404.15852","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-to-tour-operator-design-for-solution","title":"Learn to Tour: Operator Design For Solution Feasibility Mapping in Pickup-and-delivery Traveling Salesman Problem","date":"2024-04-17","arxiv_id":"2404.11458","repositories_listed":0,"syntology":null},{"url":null,"slug":"proposed-modified-computational-model-for-the","title":"Proposed modified computational model for the amoeba-inspired combinatorial optimization machine","date":"2024-04-10","arxiv_id":"2404.06828","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rolling-horizon-restoration-framework-for","title":"Formulating the Restoration of Distribution Networks as a Multiple Traveling Salesman Problem","date":"2024-04-04","arxiv_id":"2404.03197","repositories_listed":0,"syntology":null},{"url":null,"slug":"orchestrating-uavs-for-prioritized-data","title":"Orchestrating UAVs for Prioritized Data Harvesting: A Cross-Layer Optimization Perspective","date":"2024-04-01","arxiv_id":"2404.00961","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-qap-by-two-stage-graph-pointer","title":"Solving the QAP by Two-Stage Graph Pointer Networks and Reinforcement Learning","date":"2024-03-31","arxiv_id":"2404.00539","repositories_listed":0,"syntology":null},{"url":null,"slug":"less-is-more-on-the-importance-of","title":"Less Is More - On the Importance of Sparsification for Transformers and Graph Neural Networks for TSP","date":"2024-03-25","arxiv_id":"2403.17159","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-a-real-world-package-delivery-routing","title":"Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers","date":"2024-03-22","arxiv_id":"2403.15114","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-connection-between-the-capacitated","title":"Towards a connection between the capacitated vehicle routing problem and the constrained centroid-based clustering","date":"2024-03-20","arxiv_id":"2403.14013","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-guided-iterated-local-search-for-the","title":"Learning-guided iterated local search for the minmax multiple traveling salesman problem","date":"2024-03-19","arxiv_id":"2403.12389","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-constraint-programming-in-a-deep","title":"Leveraging Constraint Programming in a Deep Learning Approach for Dynamically Solving the Flexible Job-Shop Scheduling Problem","date":"2024-03-14","arxiv_id":"2403.09249","repositories_listed":0,"syntology":null},{"url":null,"slug":"looking-ahead-to-avoid-being-late-solving","title":"Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem","date":"2024-03-08","arxiv_id":"2403.05318","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-mixed-integer-conic-program-for-the-moving","title":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets","date":"2024-03-07","arxiv_id":"2403.04917","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-nested-rollout-policy-adaptation-2","title":"Generalized Nested Rollout Policy Adaptation with Limited Repetitions","date":"2024-01-18","arxiv_id":"2401.10420","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-cube-data-curriculum-for-instruction","title":"Data-CUBE: Data Curriculum for Instruction-based Sentence Representation Learning","date":"2024-01-07","arxiv_id":"2401.03563","repositories_listed":0,"syntology":null},{"url":null,"slug":"carss-cooperative-attention-guided","title":"CARSS: Cooperative Attention-guided Reinforcement Subpath Synthesis for Solving Traveling Salesman Problem","date":"2023-12-24","arxiv_id":"2312.15412","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-search-algorithm-for-an-optimal-investment","title":"A* search algorithm for an optimal investment problem in vehicle-sharing systems","date":"2023-11-15","arxiv_id":"2311.08834","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-edge-aware-graph-autoencoder-trained-on","title":"An Edge-Aware Graph Autoencoder Trained on Scale-Imbalanced Data for Traveling Salesman Problems","date":"2023-10-10","arxiv_id":"2310.06543","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-solution-samplers-for","title":"Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods","date":"2023-10-08","arxiv_id":"2310.05309","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-quadratic-assignment-problem","title":"Solving the Quadratic Assignment Problem using Deep Reinforcement Learning","date":"2023-10-02","arxiv_id":"2310.01604","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-in-the-imagination-high-level","title":"AI planning in the imagination: High-level planning on learned abstract search spaces","date":"2023-08-16","arxiv_id":"2308.08693","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parallel-ensemble-of-metaheuristic-solvers","title":"A Parallel Ensemble of Metaheuristic Solvers for the Traveling Salesman Problem","date":"2023-08-13","arxiv_id":"2308.07347","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-genetic-algorithm-for-the-min-max","title":"A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman Problem","date":"2023-07-14","arxiv_id":"2307.07120","repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-efficient-uav-assisted-iot-data","title":"Energy-Efficient UAV-Assisted IoT Data Collection via TSP-Based Solution Space Reduction","date":"2023-06-02","arxiv_id":"2306.01355","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-genetic-algorithm-and-mixed-integer","title":"Hybrid Genetic Algorithm and Mixed Integer Linear Programming for Flying Sidekick TSP","date":"2023-04-26","arxiv_id":"2304.13832","repositories_listed":0,"syntology":null},{"url":null,"slug":"base-placement-optimization-for-coverage","title":"Base Placement Optimization for Coverage Mobile Manipulation Tasks","date":"2023-04-17","arxiv_id":"2304.08246","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-genetic-algorithm-with-type-aware","title":"A Hybrid Genetic Algorithm with Type-Aware Chromosomes for Traveling Salesman Problems with Drone","date":"2023-03-01","arxiv_id":"2303.00614","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisit-the-algorithm-selection-problem-for","title":"Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural Networks","date":"2023-02-08","arxiv_id":"2302.04035","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-tour-set-traveling-salesman-problem-in","title":"Multi-Tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection","date":"2023-02-02","arxiv_id":"2302.01179","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-short-term-memory-neural-network-for-1","title":"Long Short-Term Memory Neural Network for Temperature Prediction in Laser Powder Bed Additive Manufacturing","date":"2023-01-30","arxiv_id":"2301.12904","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantization-based-optimization-alternative","title":"Quantization-Based Optimization: Alternative Stochastic Approximation of Global Optimization","date":"2022-11-08","arxiv_id":"2211.03972","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-good-is-neural-combinatorial-optimization","title":"How Good Is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem","date":"2022-09-22","arxiv_id":"2209.10913","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-the-behaviour-of-d-wave-quantum","title":"Analyzing the behaviour of D'WAVE quantum annealer: fine-tuning parameterization and tests with restrictive Hamiltonian formulations","date":"2022-07-01","arxiv_id":"2207.00253","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-tsp-with-predictions","title":"Online TSP with Predictions","date":"2022-06-30","arxiv_id":"2206.15364","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-augmented-algorithms-for-online-tsp","title":"Learning-Augmented Algorithms for Online TSP on the Line","date":"2022-06-01","arxiv_id":"2206.00655","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolution-as-a-service-a-privacy-preserving","title":"Evolution as a Service: A Privacy-Preserving Genetic Algorithm for Combinatorial Optimization","date":"2022-05-27","arxiv_id":"2205.13948","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-orienteering","title":"Deep Reinforcement Learning for Orienteering Problems Based on Decomposition","date":"2022-04-25","arxiv_id":"2204.11575","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-trajectory-design-and","title":"Energy-Sensitive Trajectory Design and Restoration Areas Allocation for UAV-Enabled Grassland Restoration","date":"2022-04-10","arxiv_id":"2204.04666","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-multi-agent-persistent-monitoring-of","title":"Minimax Multi-Agent Persistent Monitoring of a Network System","date":"2022-01-17","arxiv_id":"2201.06607","repositories_listed":0,"syntology":null},{"url":null,"slug":"reversible-action-design-for-combinatorial-1","title":"Reversible Action Design for Combinatorial Optimization with ReinforcementLearning","date":"2021-11-24","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-game-theoretic-approach-for-improving-1","title":"A Game-Theoretic Approach for Improving Generalization Ability of TSP Solvers","date":"2021-10-28","arxiv_id":"2110.15105","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-attention-lstm-hybrid-model-for-the","title":"An Attention-LSTM Hybrid Model for the Coordinated Routing of Multiple Vehicles","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-adversarial-training-for-neural","title":"Generative Adversarial Training for Neural Combinatorial Optimization Models","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"preference-conditioned-neural-multi-objective","title":"Preference Conditioned Neural Multi-objective Combinatorial Optimization","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dan-decentralized-attention-based-neural","title":"DAN: Decentralized Attention-based Neural Network for the MinMax Multiple Traveling Salesman Problem","date":"2021-09-09","arxiv_id":"2109.04205","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolving-evolutionary-algorithms-using-linear","title":"Evolving Evolutionary Algorithms using Linear Genetic Programming","date":"2021-08-21","arxiv_id":"2109.13110","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-steiner-trees-using-graph-neural","title":"Computing Steiner Trees using Graph Neural Networks","date":"2021-08-18","arxiv_id":"2108.08368","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-selection-of-informative-path","title":"Adaptive Selection of Informative Path Planning Strategies via Reinforcement Learning","date":"2021-08-14","arxiv_id":"2108.06618","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforced-hybrid-genetic-algorithm-for-the","title":"Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem","date":"2021-07-09","arxiv_id":"2107.06870","repositories_listed":0,"syntology":null},{"url":null,"slug":"qross-qubo-relaxation-parameter-optimisation","title":"QROSS: QUBO Relaxation Parameter Optimisation via Learning Solver Surrogates","date":"2021-03-19","arxiv_id":"2103.10695","repositories_listed":0,"syntology":null},{"url":null,"slug":"reversible-action-design-for-combinatorial","title":"Reversible Action Design for Combinatorial Optimization with Reinforcement Learning","date":"2021-02-14","arxiv_id":"2102.07210","repositories_listed":0,"syntology":null},{"url":null,"slug":"focusing-on-the-hybrid-quantum-computing-tabu","title":"Focusing on the Hybrid Quantum Computing -- Tabu Search Algorithm: new results on the Asymmetric Salesman Problem","date":"2021-02-11","arxiv_id":"2102.05919","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-for-predict-optimize","title":"Reinforcement Learning for Predict+Optimize","date":"2020-12-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-quantum-computing-tabu-search","title":"Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem","date":"2020-12-09","arxiv_id":"2012.04984","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-submodular-maximization","title":"Dynamic Submodular Maximization","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"galaxytsp-a-new-billion-node-benchmark-for","title":"GalaxyTSP: A New Billion-Node Benchmark for TSP","date":"2020-10-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-creative-artifacts","title":"Explaining Creative Artifacts","date":"2020-10-14","arxiv_id":"2010.07126","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-reinforcement-learning-for","title":"A Survey on Reinforcement Learning for Combinatorial Optimization","date":"2020-08-17","arxiv_id":"2008.12248","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-clustered-traveling-salesman-1","title":"Solving the Clustered Traveling Salesman Problem via TSP methods","date":"2020-07-10","arxiv_id":"2007.05254","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-combined-set-covering-and-traveling","title":"Learning Combined Set Covering and Traveling Salesman Problem","date":"2020-07-07","arxiv_id":"2007.03203","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-accurate-non-projective-dependency","title":"Fast and Accurate Non-Projective Dependency Tree Linearization","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shots-parameter-tuning-via-co-evolution","title":"Few-shots Parallel Algorithm Portfolio Construction via Co-evolution","date":"2020-07-01","arxiv_id":"2007.00501","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-combinatorial-optimization","title":"Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time","date":"2020-06-06","arxiv_id":"2006.03750","repositories_listed":0,"syntology":null},{"url":null,"slug":"extending-the-multiple-traveling-salesman","title":"Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions","date":"2020-06-02","arxiv_id":"2006.01473","repositories_listed":0,"syntology":null},{"url":null,"slug":"solve-traveling-salesman-problem-by-monte","title":"Solve Traveling Salesman Problem by Monte Carlo Tree Search and Deep Neural Network","date":"2020-05-14","arxiv_id":"2005.06879","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimal-control-theory-for-the-traveling","title":"An Optimal Control Theory for the Traveling Salesman Problem and Its Variants","date":"2020-05-07","arxiv_id":"2005.03186","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-algorithms-for-multi-robot","title":"Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency","date":"2020-05-05","arxiv_id":"2005.02530","repositories_listed":0,"syntology":null},{"url":null,"slug":"insights-on-training-neural-networks-for-qubo","title":"Insights on Training Neural Networks for QUBO Tasks","date":"2020-04-29","arxiv_id":"2004.14036","repositories_listed":0,"syntology":null},{"url":null,"slug":"gbeam-aco-a-greedy-and-faster-variant-of-beam","title":"gBeam-ACO: a greedy and faster variant of Beam-ACO","date":"2020-04-23","arxiv_id":"2004.11137","repositories_listed":0,"syntology":null},{"url":null,"slug":"coeba-a-coevolutionary-bat-algorithm-for","title":"COEBA: A Coevolutionary Bat Algorithm for Discrete Evolutionary Multitasking","date":"2020-03-24","arxiv_id":"2003.11628","repositories_listed":0,"syntology":null},{"url":null,"slug":"multifactorial-cellular-genetic-algorithm","title":"Multifactorial Cellular Genetic Algorithm (MFCGA): Algorithmic Design, Performance Comparison and Genetic Transferability Analysis","date":"2020-03-24","arxiv_id":"2003.10768","repositories_listed":0,"syntology":null}],"record_sha256":"7de35bc2105bfed052ac9b5a9b7071573085b402ef36dec4cd212046155c588b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}