Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10348335 | Computers & Operations Research | 2011 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
LuÃs Henrique Sacchi, VinÃcius Amaral Armentano,