Imagen 1 de 1
Foto genérica
Imagen 1 de 1
Foto genérica
Wiley Series in Discrete Mathematics and Optimization Ser.: Traveling Salesman Problem : A Guided Tour of Combinatorial Optimization by Jan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys and E. L. Lawler (1991, Hardcover)
Great Book Prices Store (339619)
96,8% de votos positivos
Precio:
USD434,21
Aproximadamente369,41 EUR
+ USD19,99 de envío
Devoluciones:
14 días para devoluciones. El comprador paga el envío de la devolución..
Estado:
Traveling Salesman Problem : A Guided Tour of Combinatorial Optimization, Hardcover by Lawler, E. L. (EDT), ISBN 0471904139, ISBN-13 9780471904137, Brand New, Free shipping in the US Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.
- ¡Cómpralo ya!Traveling Salesman Problem : A Guided Tour of Combinatorial Optimization, Har...
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Acerca de este artículo
Product Identifiers
PublisherWiley & Sons, Incorporated, John
ISBN-100471904139
ISBN-139780471904137
eBay Product ID (ePID)369035
Product Key Features
Number of Pages476 Pages
LanguageEnglish
Publication NameTraveling Salesman Problem : a Guided Tour of Combinatorial Optimization
SubjectData Processing, Discrete Mathematics
Publication Year1991
TypeTextbook
AuthorJan Karel Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, E. L. Lawler
Subject AreaMathematics, Computers
SeriesWiley Series in Discrete Mathematics and Optimization Ser.
FormatHardcover
Dimensions
Item Height1.3 in
Item Weight31.1 Oz
Item Length9.7 in
Item Width6.7 in
Additional Product Features
Intended AudienceScholarly & Professional
LCCN85-003158
TitleLeadingThe
Dewey Edition19
Series Volume Number12
IllustratedYes
Dewey Decimal511/.6
Table Of ContentHistory (A. Hoffman and P. Wolfe). Motivation and Modeling (R. Garfinkel). Computational Complexity (D. Johnson and C. Papadimitriou). Well-Solved Special Cases (P. Gilmore, et al.). Performance Guarantees for Heuristics (D. Johnson and C.Papadimitriou). Probabilistic Analysis of Heuristics (R. Karp and J. Steele). Empirical Analysis of Heuristics (B. Golden and W. Stewart). Polyhedral Theory (M. Grotschel and M. Padberg). Polyhedral Algorithms (M. Padberg and M. Grotschel). Branch and Bound Methods (E. Balas and P. Toth). Hamiltonian Cycles (V. Chvatal). Vehicle Routing (N. Christofides). Bibliography.
SynopsisProvides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography., Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner.
LC Classification NumberQA164.T73 1985
