Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures and is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide applicability of its evolving techniques point to the rapidity with which the field is moving and presage the ever-increasing interaction between it and computer science. The Series provides a broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, mathematical programming and the analysis of algorithms, and including such topics as Ramsey theory, transversal theory, block designs, finite geometries, Polya theory, graph and matroid algorithms, network flows, polyhedral combinatorics and computational complexity. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record in this extraordinary development. Recent titles in the Series: Local Search in Combinatorial Optimization Edited by Emile H. L. Aarts Philips Research Laboratories, Eindhoven and Eindhoven University of Technology, Eindhoven Jan Karel Lenstra Eindhoven University of Technology, Eindhoven and CWI Amsterdam In the past three decades local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time. This area of discrete mathematics is of great practical use and is attracting ever-increasing attention. The contributions to this book cover local search and its variants from both a theoretical and practical point of view, each with a chapter written by leading authorities on that particular aspect. Chapters 1 to 7 deal with the theory of local search and describe the principal search strategies such as simulated annealing, tabu search, genetic algorithms and neural networks. The remaining chapters present a wealth of results on applications of local search to problems in management science and engineering, including the traveling salesman problem, vehicle routing, machine scheduling, VLSI design and code design. This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science.
"Sinopsis" puede pertenecer a otra edición de este libro.
This book presents annotated bibliographies on important topics within the field of combinatorial optimization. However, the book offers much more than a pure bibliography as each chapter provides a concise, comprehensive and fully up-to-date survey of that area. The 24 chapters, all by leading experts, cover both method and application oriented subjects. In addition there are many sections on available software and an initial chapter reviewing the most influential texts of the last decade.From the Inside Flap:
Annotated Bibliographies in Combinatorial Optimization Edited by Mauro Dell’Amico Università di Modena, Italy Francesco Maffioli Politecnico di Milano, Italy Silvano Martello Università di Bologna, Italy This book presents annotated bibliographies on important topics within the field of combinatorial optimization. However, the book offers much more than a pure bibliography as each chapter provides a concise, comprehensive and fully up-to-date survey of that area. The 24 chapters, all by leading experts, cover both method and application oriented subjects. In addition there are many sections on available software and an initial chapter reviewing the most influential texts of the last decade. With more than 2800 annotated references this book provides An indispensable resource for more experienced researchers An ideal starting point for researchers who need to become familiar with some particular application or theory A practical guide for teachers guiding thesis work The predecessor to this book, Combinatorial Optimization: Annotated Bibliographies (edited by M. O’hEigeartaigh, J. K. Lenstra and A. H. G. Rinnooy Kan, 1985), quickly became a standard reference for researchers in the field. This new book adopts the same style and is an essential tool for all researchers who wish to keep abreast of the developments in the subject over recent years. Contents Preface List of Contributors
"Sobre este título" puede pertenecer a otra edición de este libro.
Descripción Somerset, New Jersey, U.S.A.: John Wiley & Sons Inc, 1997. Hardcover. Estado de conservación: New. Ship out 1-2 business day,Brand new,US edition, Free tracking number usually 2-4 biz days delivery to worldwide Same shipping fee with US, Canada,Europe country, Australia, item will ship out from either LA or Asia,ht. Nº de ref. de la librería ABE-7652855749