EUR 3,57 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 1612. N° de réf. du vendeur 26375642189
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 1612. N° de réf. du vendeur 370435986
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. pp. 1612. N° de réf. du vendeur 18375642183
Quantité disponible : 4 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Hardcover. Etat : New. N° de réf. du vendeur 6666-TNF-9781498770156
Quantité disponible : 10 disponible(s)
Vendeur : dsmbooks, Liverpool, Royaume-Uni
Hardcover. Etat : New. New. book. N° de réf. du vendeur D7F5-8-M-1498770150-5
Quantité disponible : 1 disponible(s)
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
UNK. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FT-9781498770156
Quantité disponible : 10 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
UNK. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FT-9781498770156
Quantité disponible : 10 disponible(s)
Vendeur : Grand Eagle Retail, Fairfield, OH, Etats-Unis
Book & Merchandise. Etat : new. Book & Merchandise. Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems.Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more.About the EditorTeofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of scheduling, graph, computational geometry, communication, routing, etc. This handbook reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781498770156
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 2nd new edition. 2576 pages. 10.00x7.00x3.62 inches. In Stock. N° de réf. du vendeur __1498770150
Quantité disponible : 1 disponible(s)
Vendeur : AussieBookSeller, Truganina, VIC, Australie
Book & Merchandise. Etat : new. Book & Merchandise. Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems.Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more.About the EditorTeofilo F. Gonzalez is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of scheduling, graph, computational geometry, communication, routing, etc. This handbook reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N° de réf. du vendeur 9781498770156
Quantité disponible : 1 disponible(s)