Glover Fred

Fred Glover

Information about the author Fred Glover will soon be added to the site.
Found 80 papers in total
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
2017
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying...
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem
2016
Ejection chain methods, which include the classical Lin–Kernighan (LK) procedure...
Path relinking for unconstrained binary quadratic programming
Path relinking for unconstrained binary quadratic programming
2012
This paper presents two path relinking algorithms to solve the unconstrained binary...
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...
A computational study on the quadratic knapsack problem with multiple constraints
A computational study on the quadratic knapsack problem with multiple constraints
2012
The quadratic knapsack problem (QKP) has been the subject of considerable research in...
A filter‐and‐fan approach to the 2D HP model of the protein folding problem
A filter‐and‐fan approach to the 2D HP model of the protein folding problem
2011
We examine a prominent and widely‐studied model of the protein folding problem,...
A simple and effective algorithm for the MaxMin diversity problem
A simple and effective algorithm for the MaxMin diversity problem
2011
The challenge of maximizing the diversity of a collection of points arises in a...
Traveling salesman problem heuristics: Leading methods, implementations and latest advances
Traveling salesman problem heuristics: Leading methods, implementations and latest advances
2011
Heuristics for the traveling salesman problem (TSP) have made remarkable advances in...
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
2011
A vital task facing government agencies and commercial organizations that report data...
Hybrid scatter tabu search for unconstrained global optimization
Hybrid scatter tabu search for unconstrained global optimization
2011
The problem of finding a global optimum of an unconstrained multimodal function has...
The case for strategic oscillation
The case for strategic oscillation
2011
We study a ‘hard’ optimization problem for metaheuristic search, where a...
Neighborhood analysis: a case study on curriculum‐based course timetabling
Neighborhood analysis: a case study on curriculum‐based course timetabling
2011
In this paper, we present an in‐depth analysis of neighborhood relations for...
RAMP for the capacitated minimum spanning tree problem
RAMP for the capacitated minimum spanning tree problem
2010
This paper introduces dual and primal-dual RAMP algorithms for the solution of the...
An ejection chain algorithm for the quadratic assignment problem
An ejection chain algorithm for the quadratic assignment problem
2010
In this study, we present a new tabu search algorithm for the quadratic assignment...
Diversification-driven tabu search for unconstrained binary quadratic problems
Diversification-driven tabu search for unconstrained binary quadratic problems
2010
This paper describes a Diversification-Driven Tabu Search (D 2 TS) algorithm for...
Ejection chain and filter-and-fan methods in combinatorial optimization
Ejection chain and filter-and-fan methods in combinatorial optimization
2010
The design of effective neighborhood structures is fundamentally important for...
Adaptive memory programming for constrained global optimization
Adaptive memory programming for constrained global optimization
2010
The problem of finding a global optimum of a constrained multimodal function has been...
Classification by vertical and cutting multi-hyperplane decision tree induction
Classification by vertical and cutting multi-hyperplane decision tree induction
2010
Two-group classification is a key task in decision making and data mining...
A note on xQx as a modelling and solution framework for the Linear Ordering Problem
A note on xQx as a modelling and solution framework for the Linear Ordering Problem
2009
This paper expands the list of 0-1 problems that can be effectively modelled and...
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
2008
Extending our work on second-order cover cuts, we introduce a new class of...
Exploiting nested inequalities and surrogate constraints
Exploiting nested inequalities and surrogate constraints
2007
The exploitation of nested inequalities and surrogate constraints as originally...
Fundamentals of scatter search and path relinking
Fundamentals of scatter search and path relinking
2000
The evolutionary approach called Scatter Search, and its generalized form called Path...
Infeasible/feasible search trajectories and directional rounding in integer programming
Infeasible/feasible search trajectories and directional rounding in integer programming
2007
The notion that strategies in non-linear and combinatorial optimization can benefit by...
Solving group technology problems via clique partitioning
Solving group technology problems via clique partitioning
2006
This paper presents a new clique partitioning (CP) model for the Group Technology (GT)...
Papers per page: