Matteo Fortini, Adam N. Letchford, Andrea Lodi and Klaus M. Wenger
Article (2011)
Document published while its authors were not affiliated with Polytechnique Montréal
An external link is available for this item
| PolyPublie URL: | https://publications.polymtl.ca/16895/ |
|---|---|
| Journal Title: | Mathematical Programming Computation (vol. 3, no. 1) |
| Publisher: | Springer |
| DOI: | 10.1007/s12532-010-0021-5 |
| Official URL: | https://doi.org/10.1007/s12532-010-0021-5 |
| Date Deposited: | 18 Apr 2023 15:12 |
| Last Modified: | 25 Sep 2024 15:54 |
| Cite in APA 7: | Fortini, M., Letchford, A. N., Lodi, A., & Wenger, K. M. (2011). Computing compatible tours for the symmetric traveling salesman problem. Mathematical Programming Computation, 3(1), 59-78. https://doi.org/10.1007/s12532-010-0021-5 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
