Variable neighborhood search and local branching

In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. Neighborhoods around the incumbent solution are defined by adding constraints to the original problem, as suggested in the recent local branching (LB) method of Fischetti and Lodi (Mathematical Programming Series B 2003;98:23

• Type: Journal
• Year: 2006
• Where: COR
• Authors: Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
• Keywords: COR 2006, General-purpose Mip Solver, Mathematical Programming Series, Variable Neighborhood Search