Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Strong Formulations for 2-Node-Connected Steiner Network Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Finding Minimum Spanning/Distances Trees by Using River Formation Dynamics
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Finding paths of length k in O∗(2k) time
Information Processing Letters
Design and analysis of stochastic local search for the multiobjective traveling salesman problem
Computers and Operations Research
Information Sciences: an International Journal
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm
EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Neuro-immune approach to solve routing problems
Neurocomputing
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Evolutionary algorithms and multi-objectivization for the travelling salesman problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Caching in the TSP Search Space
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Computational Experience with a Software Framework for Parallel Integer Programming
INFORMS Journal on Computing
Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
INFORMS Journal on Computing
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software - GLOBAL OPTIMIZATION
Reduction rules deliver efficient FPT-algorithms for covering points with lines
Journal of Experimental Algorithmics (JEA)
Fifty Years of Vehicle Routing
Transportation Science
Phrase-based statistical machine translation as a traveling salesman problem
ACL '09 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
A selfish approach to coalition formation among unmanned air vehicles in wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Proceedings of the 15th international conference on Intelligent user interfaces
Data gathering tours for mobile robots
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
An introduction to biometric-completeness: the equivalence of matching and quality
BTAS'09 Proceedings of the 3rd IEEE international conference on Biometrics: Theory, applications and systems
Scheduling task graphs optimally with A*
The Journal of Supercomputing
Scalable techniques for document identifier assignment in inverted indexes
Proceedings of the 19th international conference on World wide web
International Journal of High Performance Computing Applications
A network flow model for biclustering via optimal re-ordering of data matrices
Journal of Global Optimization
Chemical-reaction-inspired metaheuristic for optimization
IEEE Transactions on Evolutionary Computation
Consultant-guided search: a new metaheuristic for combinatorial optimization problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Elementary landscape decomposition of the quadratic assignment problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
An energy-efficient mobile recommender system
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
Mathematics of Operations Research
Determining an optimal subdivision of gene transfer partitions
ACACOS'10 Proceedings of the 9th WSEAS international conference on Applied computer and applied computational science
A comparative analysis of different infection strategies of bacterial memetic algorithms
INES'10 Proceedings of the 14th international conference on Intelligent engineering systems
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
Mathematics of Operations Research
Finding good tours for huge Euclidean TSP instances by iterative backbone contraction
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Algorithms and theory of computation handbook
Scheduling English football fixtures over the holiday period using hyper-heuristics
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Solving Very Sparse Rational Systems of Equations
ACM Transactions on Mathematical Software (TOMS)
Optimization of user satisfaction on an augmented reality based guided tour
Proceedings of the 7th International Conference on Methods and Techniques in Behavioral Research
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
Journal of Computational and Applied Mathematics
A highly-parallel TSP solver for a GPU computing platform
NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem
Journal of Artificial Intelligence Research
On Interior-Point Warmstarts for Linear and Combinatorial Optimization
SIAM Journal on Optimization
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Taxi pick-ups route optimization using genetic algorithms
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
A parallel multi-start search algorithm for dynamic traveling salesman problem
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
An exact rational mixed-integer programming solver
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Efficient Structure Learning of Bayesian Networks using Constraints
The Journal of Machine Learning Research
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Pattern discrete and mixed Hit-and-Run for global optimization
Journal of Global Optimization
Seeking global edges for traveling salesman problem in multi-start search
Journal of Global Optimization
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
Journal of Combinatorial Optimization
Computing optimal coalition structures in non-linear logistics domains
International Journal of Intelligent Information and Database Systems
The effect of the asymmetry of road transportation networks on the traveling salesman problem
Computers and Operations Research
Computer Methods and Programs in Biomedicine
Multiobjective Harmony Search Algorithm Proposals
Electronic Notes in Theoretical Computer Science (ENTCS)
The traveling salesman problem in bounded degree graphs
ACM Transactions on Algorithms (TALG)
A SAT based effective algorithm for the directed hamiltonian cycle problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Tabu search and lower bound for an industrial complex shop scheduling problem
Computers and Industrial Engineering
Improving the held and karp approach with constraint programming
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Operations Research Letters
Certification of an optimal TSP tour through 85,900 cities
Operations Research Letters
Computational experience with general cutting planes for the Set Covering problem
Operations Research Letters
Computer Science Review
George Dantzig's contributions to integer programming
Discrete Optimization
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
An evolutionary approach for the dubins' traveling salesman problem with neighborhoods
Proceedings of the 14th annual conference on Genetic and evolutionary computation
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
Large scale parallel iterated local search algorithm for solving traveling salesman problem
Proceedings of the 2012 Symposium on High Performance Computing
Robust Software Partitioning with Multiple Instantiation
INFORMS Journal on Computing
Solving tantrix via integer programming
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
A novel two-level hybrid algorithm for multiple traveling salesman problems
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Improving the performance of constructive multi-start search using record-keeping
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Fast separation algorithms for three-index assignment problems
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Using river formation dynamics to design heuristic algorithms
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Dividing a Territory Among Several Vehicles
INFORMS Journal on Computing
Are Stacker Crane Problems easy? A statistical study
Computers and Operations Research
Computing the variance of tour costs over the solution space of the TSP in polynomial time
Computational Optimization and Applications
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
A hybrid discrete particle swarm optimization with pheromone for dynamic traveling salesman problem
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
Heuristics for the traveling repairman problem with profits
Computers and Operations Research
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Evolutionary path generation for reduction of thermal variations in thermal spray coating
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Solving the simple offset assignment problem as a traveling salesman
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Dimensioning the virtual cluster for parallel scientific workflows in clouds
Proceedings of the 4th ACM workshop on Scientific cloud computing
Valid Linear Programming Bounds for Exact Mixed-Integer Programming
INFORMS Journal on Computing
Multi-robot repeated area coverage
Autonomous Robots
Priority functions for the approximation of the metric TSP
Information Processing Letters
Active planning for underwater inspection and the benefit of adaptivity
International Journal of Robotics Research
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms
Computers and Operations Research
Abstracting images into continuous-line artistic styles
The Visual Computer: International Journal of Computer Graphics
Interfaces
Three-dimensional coverage planning for an underwater inspection robot
International Journal of Robotics Research
International Journal of Metaheuristics
On branching rules for convex mixed-integer nonlinear optimization
Journal of Experimental Algorithmics (JEA)
Customized tour recommendations in urban areas
Proceedings of the 7th ACM international conference on Web search and data mining
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
Computer Networks: The International Journal of Computer and Telecommunications Networking
A backbone based TSP heuristic for large instances
Journal of Heuristics
A Market-based Solution to the Multiple Traveling Salesmen Problem
Journal of Intelligent and Robotic Systems
Hi-index | 0.00 |
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.