DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-Scale Traveling Salesman Problem

Cite

Text

Zhou et al. "DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-Scale Traveling Salesman Problem." AAAI Conference on Artificial Intelligence, 2025. doi:10.1609/AAAI.V39I25.34926

Markdown

[Zhou et al. "DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-Scale Traveling Salesman Problem." AAAI Conference on Artificial Intelligence, 2025.](https://mlanthology.org/aaai/2025/zhou2025aaai-dualopt/) doi:10.1609/AAAI.V39I25.34926

BibTeX

@inproceedings{zhou2025aaai-dualopt,
  title     = {{DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-Scale Traveling Salesman Problem}},
  author    = {Zhou, Shipei and Ding, Yuandong and Zhang, Chi and Cao, Zhiguang and Jin, Yan},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2025},
  pages     = {27178-27186},
  doi       = {10.1609/AAAI.V39I25.34926},
  url       = {https://mlanthology.org/aaai/2025/zhou2025aaai-dualopt/}
}