Glover Fred

Fred Glover

Information about the author Fred Glover will soon be added to the site.
Found 80 papers in total
Tabu search – uncharted domains
Tabu search – uncharted domains
2007
This paper is one in a special issue of Annals of Operations Research devoted to the...
Parametric tabu-search for mixed integer programs
Parametric tabu-search for mixed integer programs
2006
A parametric form of tabu-search is proposed for solving mixed integer programming...
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
2006
The state-of-the-art of local search heuristics for the traveling salesman problem...
DNA sequencing – tabu and scatter search combined
DNA sequencing – tabu and scatter search combined
2004
In this paper, a tabu-search algorithm enhanced by scatter search is presented. The...
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
2005
This paper studies the polyhedral structure of dynamic fixed-charge problems that have...
Using the unconstrained quadratic program to model and solve Max 2-SAT problems
Using the unconstrained quadratic program to model and solve Max 2-SAT problems
2005
Satisfiability (SAT) and Max-SAT problems have been the object of considerable...
Evolutionary approaches to DNA sequencing with errors
Evolutionary approaches to DNA sequencing with errors
2005
In the paper, two evolutionary approaches to the general DNA sequencing problem,...
Parametric ghost image processes for fixed-charge problems: A study of transportation networks
Parametric ghost image processes for fixed-charge problems: A study of transportation networks
2005
We present a parametric approach for solving fixed-charge problems first sketched by...
Further extension of the TSP assign neighborhood
Further extension of the TSP assign neighborhood
2005
We introduce a new extension of Punnen's exponential neighborhood for the traveling...
An unconstrained quadratic binary programming approach to the vertex coloring problem
An unconstrained quadratic binary programming approach to the vertex coloring problem
2005
The vertex coloring problem has been the subject of extensive research for many years....
Chvatal–Gomory–tier cuts for general integer programs
Chvatal–Gomory–tier cuts for general integer programs
2005
In this paper, we introduce a new class of cutting planes called Chvatal–Gomory...
Data structures and ejection chains for solving large-scale traveling salesman problems
Data structures and ejection chains for solving large-scale traveling salesman problems
2005
Data structures play a crucial role in the efficient implementation of local search...
A hybrid improvement heuristic for the one-dimensional bin packing problem
A hybrid improvement heuristic for the one-dimensional bin packing problem
2004
We propose in this work a hybrid improvement procedure for the bin packing problem....
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
2004
We propose a metaheuristic algorithm for the multi-resource generalized assignment...
Tutorial on surrogate constraint approaches for optimization in graphs
Tutorial on surrogate constraint approaches for optimization in graphs
2003
Surrogate constraint methods have been embedded in a variety of mathematical...
Foundation-penalty cuts for mixed-integer programs
Foundation-penalty cuts for mixed-integer programs
2003
We propose a new class of foundation-penalty (FP) cuts for MIPs that are easy to...
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
2002
We use surrogate analysis and constraint pairing in multidimensional knapsack problems...
One-pass heuristics for large-scale unconstrained binary quadratic problems
One-pass heuristics for large-scale unconstrained binary quadratic problems
2002
Many significant advances have been made in recent years for solving unconstrained...
Reducing the bandwidth of a sparse matrix with tabu search
Reducing the bandwidth of a sparse matrix with tabu search
2001
The bandwidth of a matrix A= { a ij } is defined as the maximum absolute difference...
Construction heuristics for the asymmetric traveling salesman problem
Construction heuristics for the asymmetric traveling salesman problem
2001
Non-Euclidean traveling salesman problem (TSP) construction heuristics, and especially...
The deterministic multi-item dynamic lot size problem with joint business volume discount
The deterministic multi-item dynamic lot size problem with joint business volume discount
2000
This paper considers the multi-item dynamic lot size model where joint business volume...
General purpose heuristics for integer programming – Part II
General purpose heuristics for integer programming – Part II
1997
In spite of the many special purpose heuristics for specific classes of integer...
Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
1999
Multistart constructive approaches operate by applying a local search procedure to...
General purpose heuristics for integer programming – Part I
General purpose heuristics for integer programming – Part I
1996
In spite of the many special purpose heuristics for specific classes of integer...
Papers per page: