Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A Computational Study Of Parametric Tabu Search For 01 Mixed Integer Programs
Author: Sacchi L.H.
Armentano V.A.
Abstract: We present a computational study of parametric tabu search for solving 01 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: 244994.]. 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. © 2010 Elsevier Ltd. All rights reserved.
Rights: fechado
Identifier DOI: 10.1016/j.cor.2010.07.004
Date Issue: 2011
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-77956396753.pdf273.86 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.