Our search deals with methods hybridizing interior point processes and metaheuristics for solving 0-1 linear programs. This paper shows how metaheuristics can take advantage of a sequence of interior points generated by an interior point method. After introducing our work field, we present our hybrid search which generates a diversified population. Next, we explain the whole method combining the solutions encountered in the previous phase through a path relinking template. Computational experiments are reported on 0-1 multiconstraint knapsack problems.

No abstract