A Pre-processing Aware RINS Based MIP Heuristic

Abstract. This paper proposes an adaptation of the RINS MIP heuristic which explicitly explores pre-processing techniques. The method systematically searches for the ideal number of fixations to produce subproblems of controlled size. These problems are explored in a Variable Neighborhood Descent fashion until a stopping criterion is met. Preliminary experiments implemented upon the open source MIP solver COINOR CBC are presented.

• Type: Journal
• Year: 2013
• Where: HM
• Authors: Thiago M. Gomes, Haroldo G. Santos, Marcone J. F. Souza
• Keywords: HM 2013, Optimization