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
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Chen, Der-San; Batson, Robert G.; Dang, Yu: Applied integer programming. Modeling and solution. (2010)
- Wilbaut, Christophe; Hanafi, Said: New convergent heuristics for 0-1 mixed integer programming (2009)
- Siarry, Patrick (ed.); Michalewicz, Zbigniew (ed.): Advances in metaheuristics for hard optimization (2008)
- Pedroso, João Pedro: Tabu search for mixed integer programming (2005)