|
Texas A&M University - SPRING 2011 | ||
Section 600 | ||
Local Search in Combinatorial Optimization (Updated Edition) by Jan Karel Lenstra (Series Editor), Emile Aarts (Editor), Emile L. Aarts Paperback, 528 Pages, Published 2003 ISBN-10: 0-691-11522-2 / 0691115222 ISBN-13: 978-0-691-11522-1 / 9780691115221 In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining hi |