Artículos de revistas
A computational study of parametric tabu search for 0-1 mixed integer programs
Registro en:
Computers & Operations Research. Pergamon-elsevier Science Ltd, v. 38, n. 2, n. 464, n. 473, 2011.
0305-0548
WOS:000282721400006
10.1016/j.cor.2010.07.004
Autor
Sacchi, LH
Armentano, VA
Institución
Resumen
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) We present a computational study of parametric tabu search for solving 0-1 mixed integer programming (MIP) problems, a generic heuristic for general MIP problems proposed by Glover [Glover F. Parametric tabu-search for mixed integer programs. Computers and Operations Research 2006; 33: 2449-94.]. This approach solves a series of linear programming problems by incorporating branching inequalities as weighted terms in the objective function. New strategies are proposed for uncovering feasible and high-quality solutions and extensive computational tests are performed on instances from the literature. (C) 2010 Elsevier Ltd. All rights reserved. 38 2 464 473 BZG Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)