The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs

DOI10.1080/00401706.2025.2573228MaRDI QIDQ7309090zbMATH OpenFDO

Authors Qiyuan Chen, Raed Al Kontar

Publication date 4 August 2026

Published in Technometrics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1080/00401706.2025.2573228

Mathematics Subject Classification ID

Applications of statistics (62Pxx)

Cites work

• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Bandits with switching costs, \(T^{2/3}\) regret
• Bayesian optimization
• Fractals in probability and analysis
• scientific article; zbMATH DE number 6433488 (Why is no real title available?)
• scientific article; zbMATH DE number 3193293 (Why is no real title available?)
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• Multi-armed Bandits with Metric Switching Costs
• On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.
• The shortest path and the shortest road through n points
• Worst-case analysis of a new heuristic for the travelling salesman problem

This page was built for publication: The Traveling Bandit: A Framework for Bayesian Optimization with Movement Costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309090)