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 Editor
Teofilo 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.
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 Editor
Teofilo 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.
Prisen for levering afhænger af typen af dit medlemskab, eller om du ikke har et medlemskab.
Hvis du ikke har et medlemsskab er priserne som følger:
Levering til pakkeshop | 39,95 kr. pr. ordre |
Hjemmelevering | 59,90 kr. pr. ordre |
Med et guldmedlemsskab er leveringspriserne:
Levering til pakkeshop. Ordrer under 250 kr. | 34,95 kr. pr. ordre |
Levering til pakkeshop. Ordrer over 250 kr. | 24,95 kr. pr. ordre |
Hjemmelevering. Ordrer under 250 kr. | 59,90 kr. pr. ordre |
Hjemmelevering. Ordrer over 250 kr. | 49,90 kr. pr. ordre |
Med et plating- eller streaming medlemsskab er leveringspriserne:
Levering til pakkeshop. Ordrer under 250 kr. | 24,95 kr. pr. ordre |
Levering til pakkeshop. Ordrer over 250 kr. | 0 kr. pr. ordre |
Hjemmelevering. Ordrer under 250 kr. | 44,90 kr. pr. ordre |
Hjemmelevering. Ordrer over 250 kr. | 19,95 kr. pr. ordre |
Bemærk venligst, at vi forbeholder os retten til at ændre i et fragtbeløb efter ordreafgivelse, hvis man som kunde har opnået en særlig fragtpris pga. køb for over 250 kr. og efterfølgende retter i sin ordre, så ordrebeløbet kommer under 250 kr. Ovenstående fragtpriser for ordrer under 250 kr. vil i så fald være gældende.
Levering
Varerne sendes indenfor 1-6 hverdage. Den konkrete leveringstid står oplyst ved hver enkelt vare. Levering sker med PostNord eller DAO distribution. Vi leverer kun i Danmark og ikke til Grønland og Færøerne.
Vær opmærksom på, at DAO ofte leverer om natten, og at der ikke skal kvitteres for modtagelse af pakken fra DAO. Hvis ikke DAO kan levere pakken forsvarligt ved dør eller i postkasse,
vil pakken i stedet blive leveret til nærmeste pakkeshop, også selvom du har betalt for hjemmelevering.