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 high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete.
download Local Search in Combinatorial Optimization pdf free
Local Search in Combinatorial Optimization books pdf online
Local Search in Combinatorial Optimization read online free book
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.