Local search in combinatorial optimization

Local search in combinatorial optimization

Join Readfeed freeFind clubs reading this bookBrowse readable books
About
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. 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.

Discuss Local search in combinatorial optimization with other readers

Join or start a book club for Local search in combinatorial optimization on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Local search in combinatorial optimization?

Sign up free on Readfeed, then browse public clubs or start your own club with Local search in combinatorial optimization as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Local search in combinatorial optimization with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Local search in combinatorial optimization with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.