skip to main content
Skip header Section
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)January 2007
Publisher:
  • Princeton University Press
  • 41 William St. Princeton, NJ
  • United States
ISBN:978-0-691-12993-8
Published:15 January 2007
Pages:
606
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience.The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.

Cited By

  1. ACM
    Li W (2024). Optimizing with Attractor: A Tutorial, ACM Computing Surveys, 56:9, (1-41), Online publication date: 31-Oct-2024.
  2. Wang X, Arslan O and Delage E (2024). Crowdkeeping in Last-Mile Delivery, Transportation Science, 58:2, (474-498), Online publication date: 1-Mar-2024.
  3. Cook W, Held S and Helsgaun K (2024). Constrained Local Search for Last-Mile Routing, Transportation Science, 58:1, (12-26), Online publication date: 1-Jan-2024.
  4. Varol T, Özener O and Albey E (2024). Neural Network Estimators for Optimal Tour Lengths of Traveling Salesperson Problem Instances with Arbitrary Node Distributions, Transportation Science, 58:1, (45-66), Online publication date: 1-Jan-2024.
  5. Wissink P (2023). The Traveling Salesman Problem with Stochastic and Correlated Customers, Transportation Science, 57:5, (1321-1339), Online publication date: 1-Sep-2023.
  6. Doan T, Bostel N, Hà M and Nguyen V (2023). New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule, Journal of Combinatorial Optimization, 46:1, Online publication date: 1-Aug-2023.
  7. Lin X, Yang Z, Zhang X and Zhang Q Continuation path learning for homotopy optimization Proceedings of the 40th International Conference on Machine Learning, (21288-21311)
  8. Fitzpatrick J, Ajwani D and Carroll P Learning to Prune Electric Vehicle Routing Problems Learning and Intelligent Optimization, (378-392)
  9. Zhang W, Sauppe J and Jacobson S (2023). Results for the close-enough traveling salesman problem with a branch-and-bound algorithm, Computational Optimization and Applications, 85:2, (369-407), Online publication date: 1-Jun-2023.
  10. Li T and Zou Q (2023). Mobile Measurement of a Dynamic Field via Compressed Sensing, IEEE Transactions on Mobile Computing, 22:5, (2802-2817), Online publication date: 1-May-2023.
  11. Broniatowski M and Stummer W (2023). A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations, IEEE Transactions on Information Theory, 69:5, (3062-3120), Online publication date: 1-May-2023.
  12. ACM
    Nannicini G, Bishop L, Günlük O and Jurcevic P (2022). Optimal Qubit Assignment and Routing via Integer Programming, ACM Transactions on Quantum Computing, 4:1, (1-31), Online publication date: 31-Mar-2023.
  13. Pacheco T, Martinelli R, Subramanian A, Toffolo T and Vidal T (2023). Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem, Transportation Science, 57:2, (463-481), Online publication date: 1-Mar-2023.
  14. Gutekunst S and Williamson D (2023). The Circlet Inequalities, Mathematics of Operations Research, 48:1, (393-418), Online publication date: 1-Feb-2023.
  15. ACM
    Lin F and Hsieh H (2022). A Grid-Based Two-Stage Parallel Matching Framework for Bi-Objective Euclidean Traveling Salesman Problem, ACM Transactions on Spatial Algorithms and Systems, 8:4, (1-33), Online publication date: 31-Dec-2022.
  16. Oxenstierna J, Malec J and Krueger V (2022). Efficient Order Batching Optimization Using Seed Heuristics and the Metropolis Algorithm, SN Computer Science, 4:2, Online publication date: 29-Dec-2022.
  17. Chen X, Tucker T, Kurfess T and Vuduc R Adaptive Deep Path: Efficient Coverage of a Known Environment under Various Configurations 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (3549-3556)
  18. Korostil A and Nikolaev A (2022). Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-Regular Multigraph, Automatic Control and Computer Sciences, 56:7, (688-700), Online publication date: 1-Dec-2022.
  19. Dienstknecht M, Boysen N and Briskorn D (2022). The traveling salesman problem with drone resupply, OR Spectrum, 44:4, (1045-1086), Online publication date: 1-Dec-2022.
  20. Choo J, Kwon Y, Kim J, Jae J, Hottung A, Tierney K and Gwon Y Simulation-guided beam search for neural combinatorial optimization Proceedings of the 36th International Conference on Neural Information Processing Systems, (8760-8772)
  21. Lera-Romero G, Miranda Bront J and Soulignac F (2022). Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, INFORMS Journal on Computing, 34:6, (3292-3308), Online publication date: 1-Nov-2022.
  22. Dutta A and Sharma G A Constant-Factor Approximation Algorithm for Online Coverage Path Planning with Energy Constraint Intelligent Human Computer Interaction, (257-270)
  23. Ács B, Dóra L, Jakab O, Jüttner A, Madarasi P and Varga L (2022). Optimizations of a Multi-Agent System for a Real-World Warehouse Problem, SN Computer Science, 3:6, Online publication date: 6-Oct-2022.
  24. Chen L, Lin S, Huang H and Yang W (2022). Charging Path Optimization in Mobile Networks, IEEE/ACM Transactions on Networking, 30:5, (2262-2273), Online publication date: 1-Oct-2022.
  25. Seraj E, Silva A and Gombolay M (2022). Multi-UAV planning for cooperative wildfire coverage and tracking with quality-of-service guarantees, Autonomous Agents and Multi-Agent Systems, 36:2, Online publication date: 1-Oct-2022.
  26. Banerjee D, Erera A and Toriello A (2022). Fleet Sizing and Service Region Partitioning for Same-Day Delivery Systems, Transportation Science, 56:5, (1327-1347), Online publication date: 1-Sep-2022.
  27. Pauleti Mendes L, Usberti F and San Felice M An Evolutionary Algorithm Applied to the Bi-Objective Travelling Salesman Problem Metaheuristics, (519-524)
  28. ACM
    Koppenhol L, Brouwer N, Dijkzeul D, Pijning I, Sleegers J and van den Berg D Exactly characterizable parameter settings in a crossoverless evolutionary algorithm Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1640-1649)
  29. ACM
    Bossek J and Neumann F Exploring the feature space of TSP instances using quality diversity Proceedings of the Genetic and Evolutionary Computation Conference, (186-194)
  30. Solyalı O and Süral H (2022). An Effective Matheuristic for the Multivehicle Inventory Routing Problem, Transportation Science, 56:4, (1044-1057), Online publication date: 1-Jul-2022.
  31. Silva D, Vinel A and Kirkici B (2022). On-Demand Public Transit, Transportation Science, 56:3, (704-724), Online publication date: 1-May-2022.
  32. Haythorpe M and Murray W (2022). Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem, Computational Optimization and Applications, 81:1, (309-336), Online publication date: 1-Jan-2022.
  33. ACM
    Mariescu-Istodor R, Cristian A, Negrea M and Cao P (2021). VRPDiv: A Divide and Conquer Framework for Large Vehicle Routing Problems, ACM Transactions on Spatial Algorithms and Systems, 7:4, (1-41), Online publication date: 31-Dec-2022.
  34. Farahani A, Genga L and Dijkman R Online Multimodal Transportation Planning using Deep Reinforcement Learning 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), (1691-1698)
  35. Guan Q, Hong X, Ke W, Zhang L, Sun G and Gong Y Kohonen Self-Organizing Map based Route Planning: A Revisit 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (7969-7976)
  36. Magnanti T (2021). Optimization, Management Science, 67:9, (5349-5363), Online publication date: 1-Sep-2021.
  37. da Costa P, Rhuggenaath J, Zhang Y, Akcay A and Kaymak U (2021). Learning 2-Opt Heuristics for Routing Problems via Deep Reinforcement Learning, SN Computer Science, 2:5, Online publication date: 1-Sep-2021.
  38. Sun Y, Ernst A, Li X and Weiner J (2021). Generalization of machine learning for problem reduction: a case study on travelling salesman problems, OR Spectrum, 43:3, (607-633), Online publication date: 1-Sep-2021.
  39. Rifki O, Garaix T and Solnon C An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE), (983-988)
  40. Osaba E, Villar-Rodriguez E, Oregi I and Moreno-Fernandez-de-Leceta A Hybrid Quantum Computing - Tabu Search Algorithm for Partitioning Problems: Preliminary Study on the Traveling Salesman Problem 2021 IEEE Congress on Evolutionary Computation (CEC), (351-358)
  41. Soloviev V, Bielza C and Larrañaga P Quantum-Inspired Estimation Of Distribution Algorithm To Solve The Travelling Salesman Problem 2021 IEEE Congress on Evolutionary Computation (CEC), (416-425)
  42. ACM
    Varadarajan S and Whitley D A parallel ensemble genetic algorithm for the traveling salesman problem Proceedings of the Genetic and Evolutionary Computation Conference, (636-643)
  43. ACM
    Karlin A, Klein N and Gharan S A (slightly) improved approximation algorithm for metric TSP Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, (32-45)
  44. Arain M, Hernandez Bennetts V, Schaffernicht E and Lilienthal A (2021). Sniffing out fugitive methane emissions, International Journal of Robotics Research, 40:4-5, (782-814), Online publication date: 1-Apr-2021.
  45. Rahmati V (2021). Near Optimum Random Routing of Uniformly Load Balanced Nodes in Wireless Sensor Networks Using Connectivity Matrix, Wireless Personal Communications: An International Journal, 116:4, (2963-2979), Online publication date: 1-Feb-2021.
  46. Gao W (2021). Modified ant colony optimization with improved tour construction and pheromone updating strategies for traveling salesman problem, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 25:4, (3263-3289), Online publication date: 1-Feb-2021.
  47. Garg N, Khanna S and Kumar A Hardness of approximation for orienteering with multiple time windows Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (2977-2990)
  48. Matei O, Erdei R and Pintea C (2021). Selective Survey, Informatica, 32:2, (371-396), Online publication date: 1-Jan-2021.
  49. van Zon M, Spliet R and van den Heuvel W (2021). The Joint Network Vehicle Routing Game, Transportation Science, 55:1, (179-195), Online publication date: 1-Jan-2021.
  50. Wolek A, McMahon J, Dzikowicz B and Houston B (2020). The Orbiting Dubins Traveling Salesman Problem: planning inspection tours for a minehunting AUV, Autonomous Robots, 45:1, (31-49), Online publication date: 1-Jan-2021.
  51. Kwon Y, Choo J, Kim B, Yoon I, Gwon Y and Min S POMO Proceedings of the 34th International Conference on Neural Information Processing Systems, (21188-21198)
  52. Delarue A, Anderson R and Tjandraatmadja C Reinforcement learning with combinatorial actions Proceedings of the 34th International Conference on Neural Information Processing Systems, (609-620)
  53. ACM
    Xiao K, Ye Z, Zhang L, Zhou W, Ge Y and Deng Y (2020). Multi-User Mobile Sequential Recommendation for Route Optimization, ACM Transactions on Knowledge Discovery from Data, 14:5, (1-28), Online publication date: 31-Oct-2020.
  54. Isoart N and Régin J Adaptive CP-Based Lagrangian Relaxation for TSP Solving Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (300-316)
  55. Gliesch A, Ritt M, Cruz A and Moreira M A hybrid heuristic for districting problems with routing criteria 2020 IEEE Congress on Evolutionary Computation (CEC), (1-9)
  56. Bossek J, Kerschke P and Trautmann H Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection 2020 IEEE Congress on Evolutionary Computation (CEC), (1-8)
  57. Ottoni A, Nepomuceno E, de Oliveira M and de Oliveira D (2019). Tuning of reinforcement learning parameters applied to SOP using the Scott–Knott method, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 24:6, (4441-4453), Online publication date: 1-Mar-2020.
  58. Benadè G and Hooker J (2019). Optimization Bounds from the Branching Dual, INFORMS Journal on Computing, 32:1, (3-15), Online publication date: 1-Jan-2020.
  59. Wang A, Meng X, Wang L, Ji X, Chen H, Liu B, Chen F, Du Y, Yin G and Wang H (2020). TLFW, Wireless Communications & Mobile Computing, 2020, Online publication date: 1-Jan-2020.
  60. Salahat E, Asselineau C, Coventry J and Mahony R Waypoint Planning for Autonomous Aerial Inspection of Large-Scale Solar Farms IECON 2019 - 45th Annual Conference of the IEEE Industrial Electronics Society, (763-769)
  61. Isoart N and Régin J Integration of Structural Constraints into TSP Models Principles and Practice of Constraint Programming, (284-299)
  62. ACM
    Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F and Trautmann H Evolving diverse TSP instances by means of novel and creative mutation operators Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, (58-71)
  63. Zhou G, Pan W and Zhou Y Multi-verse Optimization Algorithm for Solving Two-Dimensional TSP Intelligent Computing Theories and Application, (697-706)
  64. ACM
    Baioletti M, Milani A, Santucci V and Bartoccini U An experimental comparison of algebraic differential evolution using different generating sets Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1527-1534)
  65. ACM
    Ochoa G and Malan K Recent advances in fitness landscape analysis Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1077-1094)
  66. Weise T, Jiang Y, Qi Q and Liu W (2020). A Branch-and-Bound-Based Crossover Operator for the Traveling Salesman Problem, International Journal of Cognitive Informatics and Natural Intelligence, 13:3, (1-18), Online publication date: 1-Jul-2019.
  67. Holzinger A, Plass M, Kickmeier-Rust M, Holzinger K, Crişan G, Pintea C and Palade V (2019). Interactive machine learning, Applied Intelligence, 49:7, (2401-2414), Online publication date: 1-Jul-2019.
  68. ACM
    Manopiniwes W, Chernbumroong S and Thinnukool O Smart Ecotourism Planning in Chiang Mai using Traveling Salesman Problem Proceedings of the 2019 International Conference on E-business and Mobile Commerce, (40-45)
  69. Sharma G, Dutta A and Kim J Optimal Online Coverage Path Planning with Energy Constraints Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, (1189-1197)
  70. McMenemy P, Veerapen N, Adair J and Ochoa G Rigorous Performance Analysis of State-of-the-Art TSP Heuristic Solvers Evolutionary Computation in Combinatorial Optimization, (99-114)
  71. Date P, Patton R, Schuman C and Potok T (2019). Efficiently embedding QUBO problems on adiabatic quantum computers, Quantum Information Processing, 18:4, (1-31), Online publication date: 1-Apr-2019.
  72. Ye Z, Xiao K, Ge Y and Deng Y (2019). Applying Simulated Annealing and Parallel Computing to the Mobile Sequential Recommendation, IEEE Transactions on Knowledge and Data Engineering, 31:2, (243-256), Online publication date: 1-Feb-2019.
  73. Moreira Sousa M, Satoru Ochi L and de Lima Martins S An Efficient Heuristic to the Traveling Salesperson Problem with Hotel Selection Hybrid Metaheuristics, (31-45)
  74. Blum C and Gambini Santos H Generic CP-Supported CMSA for Binary Integer Linear Programs Hybrid Metaheuristics, (1-15)
  75. Berger A, Kozma L, Mnich M and Vincze R A time- and space-optimal algorithm for the many-visits TSP Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (1770-1782)
  76. (2019). The analysis of evolutionary optimisation on the TSP1,2 problem, International Journal of Computational Science and Engineering, 18:3, (261-268), Online publication date: 1-Jan-2019.
  77. Liu J, Daoud S and Amancio D (2019). Number of Spanning Trees in the Sequence of Some Graphs, Complexity, 2019, Online publication date: 1-Jan-2019.
  78. Fu X, Zhang J, Zhang L and Chang S (2019). Coalition formation among unmanned aerial vehicles for uncertain task allocation, Wireless Networks, 25:1, (367-377), Online publication date: 1-Jan-2019.
  79. Vinel A and Silva D Probability distribution of the length of the shortest tour between a few random points Proceedings of the 2018 Winter Simulation Conference, (3156-3167)
  80. Nazari M, Oroojlooy A, Takáč M and Snyder L Reinforcement learning for solving the vehicle routing problem Proceedings of the 32nd International Conference on Neural Information Processing Systems, (9861-9871)
  81. Han S, Stiffler N, Krontiris A, Bekris K and Yu J (2020). Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps, International Journal of Robotics Research, 37:13-14, (1775-1795), Online publication date: 1-Dec-2018.
  82. Mu Z, Dubois-Lacoste J, Hoos H and Stützle T (2018). On the empirical scaling of running time for finding optimal solutions to the TSP, Journal of Heuristics, 24:6, (879-898), Online publication date: 1-Dec-2018.
  83. ACM
    Faigl J and Deckerová J On Unsupervised Learning based Multi-Goal Path Planning for Visiting 3D Regions Proceedings of the 4th International Conference on Robotics and Artificial Intelligence, (45-50)
  84. ACM
    Robinson J, Vrbsky S, Hong X and Eddy B (2018). Analysis of a High-Performance TSP Solver on the GPU, ACM Journal of Experimental Algorithmics, 23, (1-22), Online publication date: 15-Nov-2018.
  85. Weller M, Chateau A, Giroudeau R, König J and Pollet V (2018). On residual approximation in solution extension problems, Journal of Combinatorial Optimization, 36:4, (1195-1220), Online publication date: 1-Nov-2018.
  86. Yildirim A and Karci A (2018). Applications of artificial atom algorithm to small-scale traveling salesman problems, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 22:22, (7619-7631), Online publication date: 1-Nov-2018.
  87. Marek J, Váňa P and Faigl J Trajectory Planning for Aerial Vehicles in the Area Coverage Problem with Nearby Obstacles Modelling and Simulation for Autonomous Systems, (226-236)
  88. Dubeň A, Pěnička R and Saska M Information Gathering Planning with Hermite Spline Motion Primitives for Aerial Vehicles with Limited Time of Flight Modelling and Simulation for Autonomous Systems, (172-201)
  89. Khudabukhsh A, Carbonell J and Jansen P (2018). Robust learning in expert networks, Journal of Intelligent Information Systems, 51:2, (207-234), Online publication date: 1-Oct-2018.
  90. ACM
    Ye Z, Zhang L, Xiao K, Zhou W, Ge Y and Deng Y Multi-User Mobile Sequential Recommendation Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (2624-2633)
  91. Riva A, Banfi J, Fanton C, Basilico N and Amigoni F A Journey Among Pairs of Vertices Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, (229-237)
  92. ACM
    Ullrich M, Weise T, Awasthi A and Lässig J A generic problem instance generator for discrete optimization problems Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1761-1768)
  93. ACM
    Weise T and Wu Z Difficult features of combinatorial optimization problems and the tunable w-model benchmark problem for simulating them Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1769-1776)
  94. ACM
    Ochoa G and Veerapen N Search-maps Proceedings of the Genetic and Evolutionary Computation Conference Companion, (504-517)
  95. Sazonov V, Skobelev P, Lada A and Mayorov I (2018). Application of Multiagent Technologies to Multiple Depot Vehicle Routing Problem with Time Windows, Automation and Remote Control, 79:6, (1139-1147), Online publication date: 1-Jun-2018.
  96. Posner J and Fohry C (2018). Hybrid work stealing of locality-flexible and cancelable tasks for the APGAS library, The Journal of Supercomputing, 74:4, (1435-1448), Online publication date: 1-Apr-2018.
  97. Kobeaga G, Merino M and Lozano J (2018). An efficient evolutionary algorithm for the orienteering problem, Computers and Operations Research, 90:C, (42-59), Online publication date: 1-Feb-2018.
  98. Rios E, Ochi L, Boeres C, Coelho V, Coelho I and Farias R (2018). Exploring parallel multi-GPU local search strategies in a metaheuristic framework, Journal of Parallel and Distributed Computing, 111:C, (39-55), Online publication date: 1-Jan-2018.
  99. Dai H, Khalil E, Zhang Y, Dilkina B and Song L Learning combinatorial optimization algorithms over graphs Proceedings of the 31st International Conference on Neural Information Processing Systems, (6351-6361)
  100. Neamatian Monemi R and Gelareh S (2017). The Ring Spur Assignment Problem, Computers and Operations Research, 88:C, (91-102), Online publication date: 1-Dec-2017.
  101. Sundar K and Rathinam S (2017). Algorithms for Heterogeneous, Multiple Depot, Multiple Unmanned Vehicle Path Planning Problems, Journal of Intelligent and Robotic Systems, 88:2-4, (513-526), Online publication date: 1-Dec-2017.
  102. ACM
    Moumen Y, Abdoun O and Daanoun A Parallel approach for genetic algorithm to solve the Asymmetric Traveling Salesman Problems Proceedings of the 2nd International Conference on Computing and Wireless Communication Systems, (1-6)
  103. ACM
    Gollapudi S, Kumar R, Panigrahy D and Panigrahy R Partitioning Orders in Online Shopping Services Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, (1319-1328)
  104. Solyal O and Sral H (2017). A multi-phase heuristic for the production routing problem, Computers and Operations Research, 87:C, (114-124), Online publication date: 1-Nov-2017.
  105. Fischer A and Hungerländer P (2017). The traveling salesman problem on grids with forbidden neighborhoods, Journal of Combinatorial Optimization, 34:3, (891-915), Online publication date: 1-Oct-2017.
  106. Cauwelaert S and Schaus P (2017). Efficient filtering for the Resource-Cost AllDifferent constraint, Constraints, 22:4, (493-511), Online publication date: 1-Oct-2017.
  107. Siemiński A Solving Dynamic Traveling Salesman Problem with Ant Colony Communities Computational Collective Intelligence, (277-287)
  108. Costa G, Delorme M, Iori M, Malaguti E and Martello S (2017). Training software for orthogonal packing problems, Computers and Industrial Engineering, 111:C, (139-147), Online publication date: 1-Sep-2017.
  109. Macharet D, Monteiro J, Mateus G and Campos M (2017). Bi-objective data gathering path planning for vehicles with bounded curvature, Computers and Operations Research, 84:C, (195-204), Online publication date: 1-Aug-2017.
  110. Kulich M, Miranda-Bront J and Peuil L (2017). A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment, Computers and Operations Research, 84:C, (178-187), Online publication date: 1-Aug-2017.
  111. ACM
    Karder J, Wagner S, Beham A, Kommenda M and Affenzeller M Towards the design and implementation of optimization networks in HeuristicLab Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1209-1214)
  112. ACM
    Liu W, Weise T, Wu Y and Qi Q Combining two local searches with crossover Proceedings of the Genetic and Evolutionary Computation Conference, (298-305)
  113. Ezugwu A, Adewumi A and Frncu M (2017). Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem, Expert Systems with Applications: An International Journal, 77:C, (189-210), Online publication date: 1-Jul-2017.
  114. ACM
    Meyer X, Chopard B and Salamin N Scheduling Finite Difference Approximations for DAG-Modeled Large Scale Applications Proceedings of the Platform for Advanced Scientific Computing Conference, (1-12)
  115. ACM
    Bottarelli L, Blum J, Bicego M and Farinelli A Path efficient level set estimation for mobile sensors Proceedings of the Symposium on Applied Computing, (262-267)
  116. Gleixner A, Berthold T, Müller B and Weltge S (2017). Three enhancements for optimization-based bound tightening, Journal of Global Optimization, 67:4, (731-757), Online publication date: 1-Apr-2017.
  117. ACM
    Ribeiro T and Paucar V Problem solving in combinatorial optimization based on the algorithmic model of attack behavior of locust swarm Proceedings of the Second International Conference on Internet of things, Data and Cloud Computing, (1-5)
  118. Blank J, Deb K and Mostaghim S Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms 9th International Conference on Evolutionary Multi-Criterion Optimization - Volume 10173, (46-60)
  119. Friedrich T, Kötzing T and Wagner M A generic bet-and-run strategy for speeding up stochastic local search Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (801-807)
  120. Bouzid M, Aït Haddadene H and Salhi S (2017). An integration of Lagrangian split and VNS, Computers and Operations Research, 78:C, (513-525), Online publication date: 1-Feb-2017.
  121. Borst S and Bradonjić M (2017). Scaling laws for maximum coloring of random geometric graphs, Discrete Applied Mathematics, 217:P3, (427-437), Online publication date: 30-Jan-2017.
  122. Hungerländer P (2017). New semidefinite programming relaxations for the Linear Ordering and the Traveling Salesman Problem, Discrete Applied Mathematics, 217:P1, (19-39), Online publication date: 30-Jan-2017.
  123. ACM
    Mosha I Global Minimum Elastic Net for the Euclidean Travelling Salesman Problem Proceedings of the 2017 International Conference on Machine Learning and Soft Computing, (122-125)
  124. (2017). Constant factor approximation algorithm for TSP satisfying a biased triangle inequality, Theoretical Computer Science, 657:PB, (111-126), Online publication date: 2-Jan-2017.
  125. da Silveira L, Tanscheit R and Vellasco M (2017). Quantum inspired evolutionary algorithm for ordering problems, Expert Systems with Applications: An International Journal, 67:C, (71-83), Online publication date: 1-Jan-2017.
  126. Crişan G, Pintea C and Palade V (2017). Emergency management using geographic information systems, Knowledge and Information Systems, 50:1, (265-285), Online publication date: 1-Jan-2017.
  127. Chen Y, Wu C and Chang S Decentralized dispatching for blocking avoidance in automated material handling systems Proceedings of the 2016 Winter Simulation Conference, (2580-2586)
  128. Bossek J and Trautmann H Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference AI*IA 2016 Advances in Artificial Intelligence, (3-12)
  129. Weise T, Wu Y, Chiong R, Tang K and Lässig J (2016). Global versus local search, Journal of Global Optimization, 66:3, (511-534), Online publication date: 1-Nov-2016.
  130. ACM
    Chuah S, Wu H, Lu Y, Yu L and Bressan S Bus Routes Design and Optimization via Taxi Data Analytics Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, (2417-2420)
  131. Song Y, Li H, Li H and Wei Y Local one-dimensional embedding interpolation for hyperspectral image classification 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC), (001034-001039)
  132. ACM
    Zhang C, Liang H and Wang K (2016). Trip Recommendation Meets Real-World Constraints, ACM Transactions on Information Systems, 35:1, (1-28), Online publication date: 3-Oct-2016.
  133. Chen L, Wang W, Huang H, Lin S, Lin Chen , Wei Wang , Hua Huang and Shan Lin (2016). On Time-Constrained Data Harvesting in Wireless Sensor Networks, IEEE/ACM Transactions on Networking, 24:5, (3123-3135), Online publication date: 1-Oct-2016.
  134. Roldán R, Basagoiti R and Coelho L (2016). Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem, Computers and Operations Research, 74:C, (14-20), Online publication date: 1-Oct-2016.
  135. Spliet R and Dekker R (2016). The driver assignment vehicle routing problem, Networks, 68:3, (212-223), Online publication date: 1-Oct-2016.
  136. Edelkamp S, Golubev D and Greulich C Solving the Physical Vehicle Routing Problem for Improved Multi-robot Freespace Navigation 39th Annual German Conference on AI on KI 2016: Advances in Artificial Intelligence - Volume 9904, (155-161)
  137. Kanda J, Carvalho A, Hruschka E, Soares C and Brazdil P (2016). Meta-learning to select the best meta-heuristic for the Traveling Salesman Problem, Neurocomputing, 205:C, (393-406), Online publication date: 12-Sep-2016.
  138. Braekers K, Ramaekers K and Van Nieuwenhuyse I (2016). The vehicle routing problem, Computers and Industrial Engineering, 99:C, (300-313), Online publication date: 1-Sep-2016.
  139. Vasilyev I, Boccia M and Hanafi S (2016). An implementation of exact knapsack separation, Journal of Global Optimization, 66:1, (127-150), Online publication date: 1-Sep-2016.
  140. Liers F, Martin A and Pape S (2016). Binary Steiner trees, Discrete Optimization, 21:C, (85-117), Online publication date: 1-Aug-2016.
  141. ACM
    Wu Y, Weise T and Liu W Hybridizing Different Local Search Algorithms with Each Other and Evolutionary Computation Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, (57-58)
  142. Conesa-Muñoz J, Pajares G and Ribeiro A (2016). Mix-opt, Expert Systems with Applications: An International Journal, 54:C, (364-378), Online publication date: 15-Jul-2016.
  143. ACM
    Chen L, Lin S and Huang H Charge me if you can Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, (101-110)
  144. ACM
    Ikuta T and Akiba T Integer programming approach for directed minimum spanning tree problem on temporal graphs Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics, (1-8)
  145. ACM
    Frieze A and Pegden W Separating subadditive euclidean functionals Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, (22-35)
  146. Fekete S, Haas A, Hemmer M, Hoffmann M, Kostitsyna I, Krupke D, Maurer F, Mitchell J, Schmidt A, Schmidt C and Troegel J Computing Nonsimple Polygons of Minimum Perimeter Proceedings of the 15th International Symposium on Experimental Algorithms - Volume 9685, (134-149)
  147. Faigl J (2016). An Application of Self-Organizing Map for Multirobot Multigoal Path Planning with Minmax Objective, Computational Intelligence and Neuroscience, 2016, (5), Online publication date: 1-Jun-2016.
  148. Venugopalan S and Sinnen O (2016). Memory limited algorithms for optimal task scheduling on parallel systems, Journal of Parallel and Distributed Computing, 92:C, (35-49), Online publication date: 1-May-2016.
  149. Delgadillo F, Montiel O and Sepúlveda R (2016). Reducing the size of traveling salesman problems using vaccination by fuzzy selector, Expert Systems with Applications: An International Journal, 49:C, (20-30), Online publication date: 1-May-2016.
  150. Bartolini E, Bodin L and Mingozzi A (2016). The traveling salesman problem with pickup, delivery, and ride-time constraints, Networks, 67:2, (95-110), Online publication date: 1-Mar-2016.
  151. Bonato A, Río-Chanona R, Macrury C, Nicolaidis J, Pérez-Giménez X, Prałat P and Ternovsky K The Robot Crawler Number of a Graph Proceedings of the 12th International Workshop on Algorithms and Models for the Web Graph - Volume 9479, (132-147)
  152. Song F, Li R and Zhou H (2015). Feasibility and issues for establishing network-based carpooling scheme, Pervasive and Mobile Computing, 24:C, (4-15), Online publication date: 1-Dec-2015.
  153. Shareef H, Ibrahim A and Mutlag A (2015). Lightning search algorithm, Applied Soft Computing, 36:C, (315-333), Online publication date: 1-Nov-2015.
  154. Ochoa G, Veerapen N, Whitley D and Burke E The Multi-Funnel Structure of TSP Fitness Landscapes Revised Selected Papers of the 12th International Conference on Artificial Evolution - Volume 9554, (1-13)
  155. Wang Y (2015). An approximate method to compute a sparse graph for traveling salesman problem, Expert Systems with Applications: An International Journal, 42:12, (5150-5162), Online publication date: 15-Jul-2015.
  156. ACM
    Dubois-Lacoste J, Hoos H and Stützle T On the Empirical Scaling Behaviour of State-of-the-art Local Search Algorithms for the Euclidean TSP Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, (377-384)
  157. Ortiz-Astorquiza C, Contreras I and Laporte G (2015). The Minimum Flow Cost Hamiltonian Cycle Problem, Discrete Applied Mathematics, 187:C, (140-154), Online publication date: 31-May-2015.
  158. Mathew N, Smith S and Waslander S (2015). Multirobot Rendezvous Planning for Recharging in Persistent Tasks, IEEE Transactions on Robotics, 31:1, (128-142), Online publication date: 1-Feb-2015.
  159. Jiang J, Gao J, Li G, Wu C and Pei Z Hierarchical Solving Method for Large Scale TSP Problems Advances in Neural Networks – ISNN 2014, (252-261)
  160. Kulakov K and Shabaev A An approach to creation of smart space-based trip planning service Proceedings of the 16th Conference of Open Innovations Association FRUCT, (38-44)
  161. Letchford A and Sørensen M (2014). A new separation algorithm for the Boolean quadric and cut polytopes, Discrete Optimization, 14:C, (61-71), Online publication date: 1-Nov-2014.
  162. Lodi A, Ralphs T and Woeginger G (2014). Bilevel programming and the separation problem, Mathematical Programming: Series A and B, 146:1-2, (437-458), Online publication date: 1-Aug-2014.
  163. Bonato T, Jünger M, Reinelt G and Rinaldi G (2014). Lifting and separation procedures for the cut polytope, Mathematical Programming: Series A and B, 146:1-2, (351-378), Online publication date: 1-Aug-2014.
  164. ACM
    Kovitz B and Swan J Tagging in metaheuristics Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, (1411-1414)
  165. ACM
    Wang Y (2014). Mobile Sensor Networks, ACM Computing Surveys, 47:1, (1-36), Online publication date: 1-Jul-2014.
  166. ACM
    Lorenzi D, Vaidya J, Shafiq B, Chun S, Vegesna N, Alzamil Z, Adam N, Wainer S and Atluri V Utilizing social media to improve local government responsiveness Proceedings of the 15th Annual International Conference on Digital Government Research, (236-244)
  167. ACM
    Leyton-Brown K, Hoos H, Hutter F and Xu L (2014). Understanding the empirical hardness of NP-complete problems, Communications of the ACM, 57:5, (98-107), Online publication date: 1-May-2014.
  168. Lochtefeld D and Ciarallo F (2014). An analysis of decomposition approaches in multi-objectivization via segmentation, Applied Soft Computing, 18:C, (209-222), Online publication date: 1-May-2014.
  169. Jaumard B, Hoang H and Kien D (2014). Robust FIPP p-cycles against dual link failures, Telecommunications Systems, 56:1, (157-168), Online publication date: 1-May-2014.
  170. Baranowski K, Koszałka L, Poźniak-Koszałka I and Kasprzak A Ant Colony Optimization Algorithm for Solving the Provider - Modified Traveling Salesman Problem Proceedings, Part I, of the 6th Asian Conference on Intelligent Information and Database Systems - Volume 8397, (493-502)
  171. Toriello A (2014). Optimal toll design, Mathematical Programming: Series A and B, 144:1-2, (247-264), Online publication date: 1-Apr-2014.
  172. Fischer A, Fischer F, Jäger G, Keilwagen J, Molitor P and Grosse I (2014). Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics, Discrete Applied Mathematics, 166:C, (97-114), Online publication date: 31-Mar-2014.
  173. ACM
    Gionis A, Lappas T, Pelechrinis K and Terzi E Customized tour recommendations in urban areas Proceedings of the 7th ACM international conference on Web search and data mining, (313-322)
  174. ACM
    Bonami P, Lee J, Leyffer S and Wächter A (2013). On branching rules for convex mixed-integer nonlinear optimization, ACM Journal of Experimental Algorithmics, 18, (2.1-2.31), Online publication date: 1-Dec-2013.
  175. Fischer A and Helmberg C (2013). The symmetric quadratic traveling salesman problem, Mathematical Programming: Series A and B, 142:1-2, (205-254), Online publication date: 1-Dec-2013.
  176. Granata D, Steeger G and Rebennack S (2013). Network interdiction via a Critical Disruption Path, Computers and Operations Research, 40:11, (2689-2702), Online publication date: 1-Nov-2013.
  177. Boryczka U and Strąk Ł Efficient DPSO Neighbourhood for Dynamic Traveling Salesman Problem Proceedings of the 5th International Conference on Computational Collective Intelligence. Technologies and Applications - Volume 8083, (721-730)
  178. ACM
    Hegels D and Müller H Evolutionary path generation for reduction of thermal variations in thermal spray coating Proceedings of the 15th annual conference on Genetic and evolutionary computation, (1277-1284)
  179. ACM
    Andrade C, Miyazawa F and Resende M Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem Proceedings of the 15th annual conference on Genetic and evolutionary computation, (463-470)
  180. Rand G (2013). Book Reviews, Interfaces, 43:4, (388-395), Online publication date: 1-Jul-2013.
  181. Dewilde T, Cattrysse D, Coene S, Spieksma F and Vansteenwegen P (2013). Heuristics for the traveling repairman problem with profits, Computers and Operations Research, 40:7, (1700-1707), Online publication date: 1-Jul-2013.
  182. ACM
    Jünger M and Mallach S Solving the simple offset assignment problem as a traveling salesman Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems, (31-39)
  183. ACM
    de Oliveira D, Viana V, Ogasawara E, Ocana K and Mattoso M Dimensioning the virtual cluster for parallel scientific workflows in clouds Proceedings of the 4th ACM workshop on Scientific cloud computing, (5-12)
  184. Steffy D and Wolter K (2013). Valid Linear Programming Bounds for Exact Mixed-Integer Programming, INFORMS Journal on Computing, 25:2, (271-284), Online publication date: 1-Apr-2013.
  185. Kumar A, Sivalingam K and Kumar A (2013). On reducing delay in mobile data collection based wireless sensor networks, Wireless Networks, 19:3, (285-299), Online publication date: 1-Apr-2013.
  186. Boryczka U and Strąk Ł A hybrid discrete particle swarm optimization with pheromone for dynamic traveling salesman problem Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II, (503-512)
  187. Kanda J, Soares C, Hruschka E and de Carvalho A A meta-learning approach to select meta-heuristics for the traveling salesman problem using MLP-Based label ranking Proceedings of the 19th international conference on Neural Information Processing - Volume Part III, (488-495)
  188. Carlsson J (2012). Dividing a Territory Among Several Vehicles, INFORMS Journal on Computing, 24:4, (565-577), Online publication date: 1-Oct-2012.
  189. ACM
    Aziz H (2012). Review of in pursuit of the traveling salesman, by William J. Cook, ACM SIGACT News, 43:3, (51-53), Online publication date: 27-Aug-2012.
  190. ACM
    Rocki K and Suda R An efficient GPU implementation of a multi-start TSP solver for large problem instances Proceedings of the 14th annual conference companion on Genetic and evolutionary computation, (1441-1442)
  191. ACM
    Guimaraes Macharet D, Alves Neto A, Fiuza da Camara Neto V and Montenegro Campos M An evolutionary approach for the dubins' traveling salesman problem with neighborhoods Proceedings of the 14th annual conference on Genetic and evolutionary computation, (377-384)
  192. Spacey S, Wiesemann W, Kuhn D and Luk W (2012). Robust Software Partitioning with Multiple Instantiation, INFORMS Journal on Computing, 24:3, (500-515), Online publication date: 1-Jul-2012.
  193. Rodríguez A and Ruiz R (2012). The effect of the asymmetry of road transportation networks on the traveling salesman problem, Computers and Operations Research, 39:7, (1566-1576), Online publication date: 1-Jul-2012.
  194. Yu Q, Wang D, Lin D, Li Y and Wu C A novel two-level hybrid algorithm for multiple traveling salesman problems Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I, (497-503)
  195. Tamir D, King C and McKenney M Improving the performance of constructive multi-start search using record-keeping Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence, (176-186)
  196. Kino F and Uno Y Solving tantrix via integer programming Proceedings of the 6th international conference on Fun with Algorithms, (245-257)
  197. ACM
    Bartal Y, Gottlieb L and Krauthgamer R The traveling salesman problem Proceedings of the forty-fourth annual ACM symposium on Theory of computing, (663-672)
  198. Dokka T, Mourtos I and Spieksma F Fast separation algorithms for three-index assignment problems Proceedings of the Second international conference on Combinatorial Optimization, (189-200)
  199. ACM
    Björklund A, Husfeldt T, Kaski P and Koivisto M (2012). The traveling salesman problem in bounded degree graphs, ACM Transactions on Algorithms, 8:2, (1-13), Online publication date: 1-Apr-2012.
  200. Rocki K and Suda R Large scale parallel iterated local search algorithm for solving traveling salesman problem Proceedings of the 2012 Symposium on High Performance Computing, (1-8)
  201. Li T and Wang Y (2012). Multiscaled combination of MR and SPECT images in neuroimaging, Computer Methods and Programs in Biomedicine, 105:1, (31-39), Online publication date: 1-Jan-2012.
  202. Ricart J, Hüttemann G, Lima J and Barán B (2011). Multiobjective Harmony Search Algorithm Proposals, Electronic Notes in Theoretical Computer Science (ENTCS), 281:C, (51-67), Online publication date: 29-Dec-2011.
  203. Kanda J, Carvalho A, Hruschka E and Soares C (2011). Selection of algorithms to solve traveling salesman problems using meta-learning, International Journal of Hybrid Intelligent Systems, 8:3, (117-128), Online publication date: 1-Aug-2011.
  204. Solyalı O and Süral H (2011). A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem, Transportation Science, 45:3, (335-345), Online publication date: 1-Aug-2011.
  205. Piwońska A and Koszelew J A memetic algorithm for a tour planning in the selective travelling salesman problem on a road network Proceedings of the 19th international conference on Foundations of intelligent systems, (684-694)
  206. Cook W, Koch T, E. D and Wolter K An exact rational mixed-integer programming solver Proceedings of the 15th international conference on Integer programming and combinatoral optimization, (104-116)
  207. Li W A parallel multi-start search algorithm for dynamic traveling salesman problem Proceedings of the 10th international conference on Experimental algorithms, (65-75)
  208. Mcconnell R, Mehlhorn K, Näher S and Schweitzer P (2011). Survey, Computer Science Review, 5:2, (119-161), Online publication date: 1-May-2011.
  209. Nunes J, Matos L and Trigo A Taxi pick-ups route optimization using genetic algorithms Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I, (410-419)
  210. ACM
    Cook W and Steffy D (2011). Solving Very Sparse Rational Systems of Equations, ACM Transactions on Mathematical Software, 37:4, (1-21), Online publication date: 1-Feb-2011.
  211. Gibbs J, Kendall G and Özcan E Scheduling English football fixtures over the holiday period using hyper-heuristics Proceedings of the 11th international conference on Parallel problem solving from nature: Part I, (496-505)
  212. ACM
    Felismino M, Luiz R, Castela M and Marques P Optimization of user satisfaction on an augmented reality based guided tour Proceedings of the 7th International Conference on Methods and Techniques in Behavioral Research, (1-5)
  213. Fujimoto N and Tsutsui S A highly-parallel TSP solver for a GPU computing platform Proceedings of the 7th international conference on Numerical methods and applications, (264-271)
  214. ACM
    Ge Y, Xiong H, Tuzhilin A, Xiao K, Gruteser M and Pazzani M An energy-efficient mobile recommender system Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, (899-908)
  215. Ernst C, Dong C, Jäger G, Richter D and Molitor P Finding good tours for huge Euclidean TSP instances by iterative backbone contraction Proceedings of the 6th international conference on Algorithmic aspects in information and management, (119-130)
  216. ACM
    Chicano F, Luque G and Alba E Elementary landscape decomposition of the quadratic assignment problem Proceedings of the 12th annual conference on Genetic and evolutionary computation, (1425-1432)
  217. ACM
    Iordache S Consultant-guided search Proceedings of the 12th annual conference on Genetic and evolutionary computation, (225-232)
  218. Jäger G and Zhang W A SAT based effective algorithm for the directed hamiltonian cycle problem Proceedings of the 5th international conference on Computer Science: theory and Applications, (216-227)
  219. Benchimol P, Régin J, Rousseau L, Rueher M and van Hoeve W Improving the held and karp approach with constraint programming Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, (40-44)
  220. Cook W, Espinoza D and Goycoolea M (2010). Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem, Mathematics of Operations Research, 35:2, (479-493), Online publication date: 1-May-2010.
  221. ACM
    Ding S, Attenberg J and Suel T Scalable techniques for document identifier assignment in inverted indexes Proceedings of the 19th international conference on World wide web, (311-320)
  222. ACM
    Pang W An intuitive texture picker Proceedings of the 15th international conference on Intelligent user interfaces, (365-368)
  223. Allender E, Loui M and Regan K Reducibility and completeness Algorithms and theory of computation handbook, (23-23)
  224. Kumar A and Sivalingam K Energy-efficient mobile data collection in wireless sensor networks with delay reduction using wireless communication Proceedings of the 2nd international conference on COMmunication systems and NETworks, (50-59)
  225. ACM
    Estivill-Castro V, Heednacram A and Suraweera F (2010). Reduction rules deliver efficient FPT-algorithms for covering points with lines, ACM Journal of Experimental Algorithmics, 14, (1.7-1.26), Online publication date: 1-Dec-2009.
  226. Laporte G (2009). Fifty Years of Vehicle Routing, Transportation Science, 43:4, (408-416), Online publication date: 1-Nov-2009.
  227. Bhadauria D and Isler V Data gathering tours for mobile robots Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (3868-3873)
  228. Paquete L and Stützle T (2009). Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Computers and Operations Research, 36:9, (2619-2631), Online publication date: 1-Sep-2009.
  229. Zaslavskiy M, Dymetman M and Cancedda N Phrase-based statistical machine translation as a traveling salesman problem Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1, (333-341)
  230. ACM
    Jähne M, Li X and Branke J Evolutionary algorithms and multi-objectivization for the travelling salesman problem Proceedings of the 11th Annual conference on Genetic and evolutionary computation, (595-602)
  231. Xu Y, Ralphs T, Ladányi L and Saltzman M (2009). Computational Experience with a Software Framework for Parallel Integer Programming, INFORMS Journal on Computing, 21:3, (383-397), Online publication date: 1-Jul-2009.
  232. Linderoth J, Margot F and Thain G (2009). Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing, INFORMS Journal on Computing, 21:3, (445-457), Online publication date: 1-Jul-2009.
  233. Masutti T and de Castro L (2009). Neuro-immune approach to solve routing problems, Neurocomputing, 72:10-12, (2189-2197), Online publication date: 1-Jun-2009.
  234. Fernau H and Raible D Searching Trees Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation, (59-70)
  235. Masutti T and de Castro L (2009). A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem, Information Sciences: an International Journal, 179:10, (1454-1468), Online publication date: 20-Apr-2009.
  236. Björklund A, Husfeldt T, Kaski P and Koivisto M The Travelling Salesman Problem in Bounded Degree Graphs Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I, (198-209)
  237. Rabanal P, Rodríguez I and Rubio F Using river formation dynamics to design heuristic algorithms Proceedings of the 6th international conference on Unconventional Computation, (163-177)
  238. Popoviciu N and Boncuţ M A neural network algorithm in matrix form and a heuristic greedy method for traveling salesperson problem Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation, (209-215)
Contributors
  • Rice University
  • Concordia University
  • University of Bonn

Recommendations

Idalia Flores

Reactive systems are systems whose behavior is not described algorithmically (by a relation between inputs and outputs), but rather by the way they continuously interact with the environment. The authors present and use some process calculi and verification tools to introduce model-based analysis of reactive systems. The book makes an excellent case for the usefulness of formal methods and models outside academic circles. The first part of the book covers the calculus of communicating systems (CCS), labeled transition systems, and Hennessy-Milner logic. The second part presents timed extensions for real-time systems: timed automata, timed CCS, timed labeled transition systems, and a real-time version of the Hennessy-Milner logic. The first part contains six chapters. Chapters 2 and 3 present CCS and behavioral equivalences. Chapter 4 makes a detour into order theory, presenting some notions and results, such as Tarski's fixed-point theorem, that allow the presentation of bisimulation as a fixed point. Chapters 5 and 6 introduce Hennessy-Milner logic and recursive definitions, ending with an overview of results related to model checking. In the final chapter of this part, the authors use the theory presented so far to model and analyze mutual exclusion algorithms. The second part has a similar structure, starting with the presentation of timed CCS. Chapters 10 and 11 introduce timed automata and timed behavioral equivalences. Chapter 12 presents Hennessy-Milner logic with time. This part ends with Fischer's algorithm for deadlock-free mutual exclusion under timing constraints. The book has arisen from various courses taught over six years in Iceland and Denmark, and is designed to give a broad introduction to reactive systems, with exercises throughout. The presentation is clear and intuitive enough to benefit any student interested in concurrency theory and process algebra. Several examples, many figures, and a rich bibliography are provided to assist the reader in understanding. This is an admirable piece of work, particularly for its pedagogical approach. I recommend it as an excellent textbook to those who teach concurrency theory and software tools for the model-based analysis of computing systems. Online Computing Reviews Service

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.