Heuristic Algorithms for the Traveling Salesman Problem (2007)
Cesar Rego, Dorabela Gamboa, Fred Glover
The traveling salesman problem (TSP) has been frequently used as a testbed for the study of new local
A new modeling and solution approach for the number partitioning problem (2005)
Bahram Alidaee, Fred Glover, Gary A. Kochenberger, Cesar Rego
The number partitioning problem has proven to be a challenging problem for both exact and heuristic solution methods. We present a new modeling and solution approach that consists of recasting the...
A new modeling and solution approach for the number partitioning problem (2005)
Bahram Alidaee, Fred Glover, Gary A. Kochenberger, Cesar Rego
The number partitioning problem has proven to be a challenging problem for both exact and heuristic solution methods. We present a new modeling and solution approach that consists of recasting the...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee, Cesar Rego
The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods have been proposed for...
One-pass heuristics for large-scale unconstrained binary quadratic problems
Glover, Fred, Alidaee, Bahram, Rego, Cesar, Kochenberger, Gary
A cooperative parallel tabu search algorithm for the quadratic assignment problem
James, Tabitha, Rego, Cesar, Glover, Fred
In this study, we introduce a cooperative parallel tabu search algorithm (CPTS) for the quadratic assignment problem (QAP). The QAP is an NP-hard combinatorial optimization problem that is widely...