Parametric tabu-search for mixed integer programs

A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying branching inequalities as weighted terms in the objective function. The approach extends and modifies a parametric branch and bound procedure of Glover [Parametic branch and bound. OMEGA, The International Journal of Management Science 1978;6:1

• Type: Journal
• Year: 2006
• Where: COR
• Authors: Fred Glover
• Keywords: Adaptive Memory, COR 2006, Objective Function, Problems