Results 251 to 260 of about 65,085 (288)
Some of the next articles are maybe not open access.
Journal of the Operational Research Society, 1999
A. Tuson, F. Glover, M. Laguna
openaire +2 more sources
A. Tuson, F. Glover, M. Laguna
openaire +2 more sources
2002
Tabu Search (TS) and Lagrangean relaxation (LR) are important techniques for solving large-scale combinatorial optimization problems. They have been applied successfully to a wide range of different problems from such diverse areas as routing and scheduling, network design, cutting and packing, production planning etc. In this paper we will outline how
openaire +1 more source
Tabu Search (TS) and Lagrangean relaxation (LR) are important techniques for solving large-scale combinatorial optimization problems. They have been applied successfully to a wide range of different problems from such diverse areas as routing and scheduling, network design, cutting and packing, production planning etc. In this paper we will outline how
openaire +1 more source
1994
Tabu Search is a metastrategy for guiding known heuristics to overcome local optimality. Although still in its infancy, during the last few years successful applications of this kind of metaheuristic to a great variety of problems have been reported in the literature.
openaire +1 more source
Tabu Search is a metastrategy for guiding known heuristics to overcome local optimality. Although still in its infancy, during the last few years successful applications of this kind of metaheuristic to a great variety of problems have been reported in the literature.
openaire +1 more source
A Tabu Search Heuristic for the Vehicle Routing Problem
Management Science, 1994Michel Gendreau +2 more
exaly