The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics
Cite as
Bossek, J., Casel, K., Kerschke, P., & Neumann, F. (2020). The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '20), Cancun, Mexico, 1286–1294.Details
Publication type
Research article in proceedings (conference)
Peer reviewed
Yes
Publication status
Published
Year
2020
Conference
Genetic and Evolutionary Computation Conference (GECCO '20)
Venue
Cancun, Mexico
Pages range
1286–1294
Publisher
ACM
Language
English
DOI
Full text