Parametric tabu-search for mixed integer programs |
| |
Authors: | Fred Glover |
| |
Affiliation: | Leeds School of Business, University of Colorado, Boulder, CO 80309-0419, USA |
| |
Abstract: | 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–9], replacing its tree search memory by the adaptive memory framework of tabu-search and introducing new associated strategies that are more flexible than the mechanisms of branch and bound. |
| |
Keywords: | Mixed integer programming Tabu search Metaheuristics Adaptive memory |
本文献已被 ScienceDirect 等数据库收录! |
|