Local Search in Combinatorial Optimization (Repost)
Local Search in Combinatorial Optimization By Emile Aarts, Jan Karel Lenstra
1997 | 488 Pages | ISBN: 0471948225 | DJVU | 14 MB
1997 | 488 Pages | ISBN: 0471948225 | DJVU | 14 MB
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.