LocalSolver 1.0
tbenoist | 23 février 2010Local search is one of the most effective approaches for practically solving combinatorial optimization problems. It basically consists in moving from one solution to another by applying local changes, tending to improve the objective function. In particular, local search is a technique of choice when a high-quality solution has to be obtained in a few minutes, which is a frequent situation in the practice of operations research. For numerous large-scale optimization problems, state-of-the-art solution algorithms are indeed based on local search techniques.



