We present a computational study of parametric tabu search for solving 0–1 mixed integer programming (MIP) problems, a generic heuristic for general MIP ...

Feb 1, 2011 · We present a computational study of parametric tabu search for solving 0-1 mixed integer programming (MIP) problems, a generic heuristic for ...

In this paper, we describe the implementation of some heuristics for convex mixed integer nonlinear programs. The work focuses on three families of heuristics ...

We have conducted a computational study of the core version of parametric tabu search for solving 0-1 MIP problems. In the parametric approach, branching ...

This paper gives a general design for a parametric tabu-search method for mixed integer programming (MIP) problems. The approach embraces a collection of ...

A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming ...

Oct 10, 2005 · A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear ...

A computational study of parametric tabu search for 0–1 mixed integer programs. Computers & Operations Research, Vol. 38, No. 2. Branch‐and‐Bound Algorithms.

The goal of this article is to survey many of the results regarding branch-and-bound search strategies and evaluate them again in light of the other ...

This paper introduces tabu search for the solution of general linear integer problems. Search is done on integer variables; if there are continuous ...