Best Book Mart

SUBJECTS

ADV. SEARCH

Home > Subjects > Others

Local Search in Combinatorial Optimization

	Local Search In Combinatorial Optimization by Emile Aarts , Jan Karel Lenstra
	Price : Rs 395.00
	Your Price : Rs 355.50

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatiorial 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 aleading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. ISBN - 9788122419993

Pages : 528