Combining Reinforcement Learning and Optimal Transport for the Traveling Salesman Problem
The traveling salesman problem is a fundamental combinatorial optimization problem with strong exact algorithms. However, as problems scale up, these exact algorithms fail to provide a solution in a reasonable time. To resolve this, current works look at utilizing deep learning to construct reasonab...
Saved in:
Published in | arXiv.org |
---|---|
Main Authors | , , , , |
Format | Paper |
Language | English |
Published |
Ithaca
Cornell University Library, arXiv.org
02.03.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!