The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12) - Image 1

Price loading...

Springer The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12)

Name: The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12)
Brand: Springer

Managers' Guides to Computing

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

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. 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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 0387444599
Category: Books > Subjects > Business, Finance & Law > E-Commerce > Managers' Guides to Computing
Domain: Amazon UK
Release Date: 18 May 2007
Listed Since: 04 January 2007

Barcode

No barcode data available

Springer The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12)

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization: 12 (Wiley Series in Discrete Mathematics & Optimization)

Springer Metaheuristics for Combinatorial Optimization 1332

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

Nonlinear Multiobjective Optimization: 12 (International Series in Operations Research & Management Science, 12)

Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research: 12 (Operations Research/Computer Science Interfaces Series, 12)

Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research: 12 (Operations Research/Computer Science Interfaces Series, 12)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Combinatorial Optimization: Polyhedra and Efficiency: 24 (Algorithms and Combinatorics, 24)

Nature Inspired Optimisation for Delivery Problems: From Theory to the Real World (Natural Computing Series)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

The Traveling Salesman Problem – A Computational Study: 17 (Princeton Series in Applied Mathematics)

Spanning Trees and Optimization Problems: 19 (Discrete Mathematics and Its Applications)

Introduction to Combinatorial Optimization: 196 (Springer Optimization and Its Applications, 196)

Optimization Theory

Arc Routing: Theory, Solutions and Applications

Handbook of Combinatorial Optimization

Local Search in Combinatorial Optimization

Meta-Heuristics: Theory and Applications

Bio-inspired Algorithms for the Vehicle Routing Problem: 161 (Studies in Computational Intelligence, 161)

Graph Theory and Combinatorial Optimization

Meta-Heuristics: Theory and Applications