traveling salesman problem

Learning Collaborative Policies to Solve NP-hard Routing Problems NeurIPS 2021 Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer NeurIPS 2021 Matrix encoding networks for neural combinatorial optimization NeurIPS 2021 NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem NeurIPS 2021 An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems AAAI 2020 Deep Neural Network Approximated Dynamic Programming for Combinatorial Optimization AAAI 2020 Differentiation of Blackbox Combinatorial Solvers ICLR 2020 Fast and Accurate Non-Projective Dependency Tree Linearization ACL 2020 Learning 2-opt Heuristics for the Traveling Salesman Problem via Deep Reinforcement Learning ACML 2020 Planning in Hierarchical Reinforcement Learning: Guarantees for Using Local Policies ALT 2020 POMO: Policy Optimization with Multiple Optima for Reinforcement Learning NeurIPS 2020 Attention, Learn to Solve Routing Problems! ICLR 2019 How to Tame Your Anticipatory Algorithm IJCAI 2019 Learning to Solve NP-Complete Problems: A Graph Neural Network for Decision TSP AAAI 2019 Anytime Focal Search with Applications IJCAI 2018 Optimal Solution of the Generalized Dubins Interval Problem RSS 2018 An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization IJCAI 2017 Learning Combinatorial Optimization Algorithms over Graphs NeurIPS 2017 Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning NeurIPS 2014 On the Dubins Traveling Salesperson Problems: novel approximation algorithms RSS 2006 Rearrangement Clustering: Pitfalls, Remedies, and Applications JMLR 2006