Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
85 Publications
- 1
- 2
- 3
- 4
- 5 (current)
2013 | Journal Article | LibreCat-ID: 48889
Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem. Annals of Mathematics and Artificial Intelligence. 2013;69(2):151–182. doi:10.1007/s10472-013-9341-2
LibreCat
| DOI
2013 | Journal Article | LibreCat-ID: 46394
Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. Annals of Mathematics and Artificial Intelligence. 2013;69:151–182.
LibreCat
2012 | Conference Paper | LibreCat-ID: 48890
Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219. LION 6. Springer-Verlag; 2012:115–129.
LibreCat
2012 | Book Chapter | LibreCat-ID: 48888
Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: Learning and Intelligent Optimization. Vol 7219. Springer Berlin Heidelberg; 2012:115–129. doi:10.1007/978-3-642-34413-8_9
LibreCat
| DOI
2012 | Conference Paper | LibreCat-ID: 46398
Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: Hamadi Y, Schoenauer M, eds. Learning and Intelligent Optimization. Springer Berlin Heidelberg; 2012:115–129. doi:https://doi.org/10.1007/978-3-642-34413-8_9
LibreCat
| DOI
- 1
- 2
- 3
- 4
- 5 (current)