Previously we talked about constraint programming, which actually works with partial assignments, we try to extend them, and to prune search space as much as possible. Another method, called local search, is very different. Simply put, local search is moving the configuration from it’s current state to a state which is very close to it, i.e. … Continue reading Discrete Optimization: Local Search