Symmetry alignment based neural solver for combinatorial optimization

DOI10.1016/J.TCS.2026.116182MaRDI QIDQ7347269zbMATH OpenFDO

Authors Zizhen Zhang, Guoyao Rao, Deying Li, Yongcai Wang, Wenping Chen, Yuqing Zhu

Publication date 14 September 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116182

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• A method for solving traveling-salesman problems
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Deep policy dynamic programming for vehicle routing problems
• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 1302201 (Why is no real title available?)
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• New benchmark instances for the capacitated vehicle routing problem
• Reinforcement learning. An introduction
• The traveling salesman problem: An overview of exact and approximate algorithms
• The traveling salesman problem. A computational study.
• TSPLIB—A Traveling Salesman Problem Library
• Vehicle routing problems with alternative paths: an application to on-demand transportation

This page was built for publication: Symmetry alignment based neural solver for combinatorial optimization

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