| Local Branching: Basics and Extensions (2005) | |||||||||||||||
Abstract | |||||||||||||||
| The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical applications. In the present paper we investigate the use of a generic MIP solver as a black-box “tactical ” tool to explore effectively suitable solution subspaces defined and controlled at a “strategic ” level by a simple external branching framework. The procedure is in the spirit of well-known local search metaheuristics, but the neighborhoods are obtained through the introduction in the MIP model of completely general | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||