Integrating Local Search Techniques Into A Mathematical Programming Solver
By: Thierry Benoist (from IFORS News September 2013)
Mixed Integer Linear Programming (MIP) is undoubtedly one of the most powerful tools of Operations Research (OR). Its ease of use appeals to OR professionals: the user models the problem as an integer linear program and the MIP engine solves it by branch & bound & cut. This ``model & run’’ approach, when effective, reduces considerably development and maintenance of optimization software, and other tree search-based technologies like Constraint Programming (CP) are following the way.
Link to material: http://ifors.org/wiki/tutorials-newsletter/integrating-local-search.pdf