Pdf on jan 1 2004 james b orlin and others published local search in combinatorial optimization find read and cite all the research you need on researchgate. Local search is a widely used general approach to solving hard optimization problems an optimization problem has a set ofsolutionsand acost functionthat assigns a numerical value to every solutionthe goal is to find anoptimalsolution one that has the minimum or maximum costto obtain a local search heuristic for an optimization problem one superimposes aneighborhood structureon the . 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. A kolen and e pesch 1994 genetic local search in combinatorial optimization discrete applied mathematics 48 273 284 crossref mathscinet google scholar pjm van laarhoven and ehl aarts 1987 simulated annealing theory and applications reider dordrecht google scholar
How it works:
1. Register Trial Account.
2. Download The Books as you like ( Personal use )