Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume, which contains chapters written by reputable researchers, provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. Audience This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.

Combinatorial optimization. --- Traveling-salesman problem. --- Traveling-salesman problem --- Combinatorial optimization --- Engineering & Applied Sciences --- Mathematics --- Physical Sciences & Mathematics --- Computer Science --- Algebra --- Optimization, Combinatorial --- TSP (Traveling salesman problem) --- Computer science. --- Operations research. --- Decision making. --- Computer science --- Algorithms. --- Mathematical optimization. --- Computer Science. --- Discrete Mathematics in Computer Science. --- Optimization. --- Operation Research/Decision Theory. --- Mathematics. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Algorism --- Arithmetic --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Informatics --- Science --- Foundations --- Decision making --- Computer science—Mathematics. --- Operations Research/Decision Theory. --- Traveling salesman problem. --- Combinatorial analysis --- Mathematical optimization --- Graph theory --- Vehicle routing problem

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This edited volume offers a detailed account on the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic. Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field. Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.

Directed graphs. --- Mathematics. --- Algorithms. --- Computer science --- Graph theory. --- Graph Theory. --- Discrete Mathematics in Computer Science. --- Algorithm Analysis and Problem Complexity. --- Digraphs (Graph theory) --- Oriented graphs --- Graph theory --- Computational complexity. --- Computer software. --- Software, Computer --- Computer systems --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computer science—Mathematics. --- Algorism --- Algebra --- Arithmetic --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Foundations --- Extremal problems --- Discrete mathematics. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Computer mathematics --- Mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This edited volume offers a detailed account on the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic. Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field. Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.

Statistical science --- Complex analysis --- Discrete mathematics --- Mathematical statistics --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- grafieken --- complexiteit --- discrete wiskunde --- complexe analyse (wiskunde) --- bio-informatica --- bedrijfssoftware --- informatica --- statistiek

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume, which contains chapters written by reputable researchers, provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. Audience This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.