Image de couverture de livre

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Long, Zheng, Jiongzhi, Xiong, Zhengda, He, Kun
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Artificial Intelligence
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Kernighan-Lin Search Algorithm
par: Dasdan, Ali
Publié: (2025)

Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems
par: Wang, Long, et autres
Publié: (2025)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
par: Jin, Mingming, et autres
Publié: (2023)

Two New Upper Bounds for the Maximum k-plex Problem
par: Zheng, Jiongzhi, et autres
Publié: (2023)

A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
par: Philip, Allen George, et autres
Publié: (2024)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
par: Antoniadis, Antonios, et autres
Publié: (2020)

A faster heuristic for the Traveling Salesman Problem with Drone
par: Hokama, Pedro H. D. B., et autres
Publié: (2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma
par: Böhm, Martin, et autres
Publié: (2024)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
par: Nguyen, Hue T., et autres
Publié: (2025)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
par: Xue, Jinghui, et autres
Publié: (2024)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
par: Clementino, Thailsson, et autres
Publié: (2025)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
par: Luo, Chunyu, et autres
Publié: (2024)

Parameterized Complexity of Directed Traveling Salesman Problem
par: Blažej, Václav, et autres
Publié: (2025)

Introduction to Multi-Armed Bandits
par: Slivkins, Aleksandrs
Publié: (2019)

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
par: Philip, Allen George, et autres
Publié: (2023)

A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
par: Saller, Sophia, et autres
Publié: (2023)

Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows
par: Soulignac, Francisco J.
Publié: (2025)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
par: Pedramfar, Mohammad, et autres
Publié: (2023)

Convergence of a L2 regularized Policy Gradient Algorithm for the Multi Armed Bandit
par: Anita, Stefana, et autres
Publié: (2024)

Learning-Based Algorithms for Graph Searching Problems
par: DePavia, Adela Frances, et autres
Publié: (2024)

Online Algorithms with Unreliable Guidance
par: Dallot, Julien, et autres
Publié: (2026)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
par: Zhong, Xianghui
Publié: (2019)

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
par: Ghaseminia, Benyamin, et autres
Publié: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
par: Mitzenmacher, Michael, et autres
Publié: (2025)

Scalable Algorithms for Approximate DNF Model Counting
par: Burkhardt, Paul, et autres
Publié: (2026)

A Survey on the Densest Subgraph Problem and Its Variants
par: Lanciano, Tommaso, et autres
Publié: (2023)

Enhanced Methods for the Weight Constrained Shortest Path Problem
par: Ahmadi, Saman, et autres
Publié: (2022)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
par: Ganian, Robert, et autres
Publié: (2025)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
par: la Tour, Max Dupré, et autres
Publié: (2024)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
par: Fioravantes, Foivos, et autres
Publié: (2025)

Adaptive Multi-Round Allocation with Stochastic Arrivals
par: Pan, Yuqi, et autres
Publié: (2026)

An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
par: Ehimwenma, Kennedy E., et autres
Publié: (2025)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
par: Pham, Canh V.
Publié: (2024)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
par: Karpov, Nikolai, et autres
Publié: (2025)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
par: Chen, Wen-Ling, et autres
Publié: (2025)

Stochastic Multi-round Submodular Optimization with Budget
par: Auletta, Vincenzo, et autres
Publié: (2024)

Effective Traveling for Metric Instances of the Traveling Thief Problem
par: Eube, Jan, et autres
Publié: (2026)

Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
par: Tacheny, Nicolas
Publié: (2026)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
par: Assadi, Sepehr, et autres
Publié: (2023)