MIPTS

Tabu search for mixed integer programming This paper introduces tabu search for the solution of general linear integer problems. Search is done on integer variables; if there are continuous variables, their corresponding value is determined through the solution of a linear program, which is also used to evaluate the integer solution. The complete tabu search procedure includes an intensification and diversification procedure, whose effects are analysed on a set of benchmark problems. (Source: http://plato.asu.edu)

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element