Punnen a p (26 resultados)

Condición: Poor. Volume 12. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Book contains pencil markings. In poor condition, suitable as a reading copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1350grams, ISBN:9781402006647.…

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condición: New. pp. 852.

Condición: New.

Condición: New.

Condición: New. pp. 852 Illus.

Condición: New. pp. 852.

Condición: As New. Unread book in perfect condition.

Condición: New.

Taschenbuch. Condición: Neu. The Traveling Salesman Problem and Its Variations | G. Gutin (u. a.) | Taschenbuch | Combinatorial Optimization | xviii | Englisch | 2007 | Springer | EAN 9780387444598 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Condición: New. In English.

Condición: New. Offers a treatment of a knotty problem in computing. This volume provides the developments in theory and algorithms for the traveling salesman problem (TSP). It covers the important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, and probabilistic aspects of TSP. Editor(s): Gutin, Gregory; Punnen, Abraham P. Series: Combinatorial Optimization. Num Pages: 830 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 44. Weight in Grams: 1359. . 2002. Hardback. . . . . …

Paperback. Condición: Brand New. 1st edition. 830 pages. 9.00x6.25x1.75 inches. In Stock.

Hardcover. Condición: Brand New. 830 pages. 9.50x6.50x1.75 inches. In Stock.

Condición: New. Offers a treatment of a knotty problem in computing. This volume provides the developments in theory and algorithms for the traveling salesman problem (TSP). It covers the important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, and probabilistic aspects of TSP. Editor(s): Gutin, Gregory; Punnen, Abraham P. Series: Combinatorial Optimization. Num Pages: 830 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 44. Weight in Grams: 1359. . 2002. Hardback. . . . . Books ship from the US and Ireland. …

hardcover. Condición: New. In shrink wrap. Looks like an interesting title.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides the state of the art in theory and algorithms for the traveling salesman problem (TSP)Written by reputable researchers, covering all important areas of study on TSPIntended for researchers, practitioners, and academicians in mathem.…

Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Provides the state of the art in theory and algorithms for the traveling salesman problem (TSP)Written by reputable researchers, covering all important areas of study on TSPIntended for researchers, practitioners, and academicians in mathem.…

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and 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, and includes a thorough computational analysis of heuristic and metaheuristic algorithms. 852 pp. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and 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, and includes a thorough computational analysis of heuristic and metaheuristic algorithms. 852 pp. Englisch.…

Buch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 852 pp. Englisch.…

Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 852 pp. Englisch.…

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.…