Add to ORKGAbstract This paper introduces tabu search for the solution of general linear integer prob-lems. 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 pro-cedure includes an intensification and diversification procedure, whose effects are analysed on a set of benchmark problems
In this work we present a domain-independent Tabu Search approach for multiobjective optimization wi...
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-k...
We present a computational study of parametric tabu search for solving 01 mixed integer programming ...
We describe the main features of tabu search, emphasizing a perspective for guiding a user to unders...
The branch and bound procedure for solving mixed integer programming (MIP) problems using linear pro...
The branch and bound procedure for solving mixed integer programming (MIP) problems using linear pr...
The goal of this book is to report original researches on algorithms and applications of Tabu Search...
Resumo: Este trabalho apresenta um estudo computacional da busca tabu paramétrica para resolver prob...
A generalization on the tabu search method, recently developed for combinatorial optimization proble...
A generalization on the tabu search method, recently developed for combinatorial optimization proble...
Although tabu search algorithms have been used for combinatorial problems such as assignment, schedu...
In the present work we study the problems of integer linear optimi- zation, at first from the theore...
Engineering and technology have been continuously providing examples of difficult optimization probl...
Discusses the application of tabu search (an iterative procedure for solving discrete combinatorial ...
In this work we present a domain-independent Tabu Search approach for multiobjective optimization wi...
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-k...
We present a computational study of parametric tabu search for solving 01 mixed integer programming ...
We describe the main features of tabu search, emphasizing a perspective for guiding a user to unders...
The branch and bound procedure for solving mixed integer programming (MIP) problems using linear pro...
The branch and bound procedure for solving mixed integer programming (MIP) problems using linear pr...
The goal of this book is to report original researches on algorithms and applications of Tabu Search...
Resumo: Este trabalho apresenta um estudo computacional da busca tabu paramétrica para resolver prob...
A generalization on the tabu search method, recently developed for combinatorial optimization proble...
A generalization on the tabu search method, recently developed for combinatorial optimization proble...
Although tabu search algorithms have been used for combinatorial problems such as assignment, schedu...
In the present work we study the problems of integer linear optimi- zation, at first from the theore...
Engineering and technology have been continuously providing examples of difficult optimization probl...
Discusses the application of tabu search (an iterative procedure for solving discrete combinatorial ...
In this work we present a domain-independent Tabu Search approach for multiobjective optimization wi...
The problem is represented mathematically as a new mixed integer linear programming (MILP) model. Ex...
We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-k...