9 citations · 28 across the 15 of their papers we have counts for
17 papers
Heuristic Search for Rank Aggregation with Application to Label Ranking
Yangming Zhou, Jin-Kao Hao, Zhen Li +1
Rank aggregation aims to combine the preference rankings of a number of alternatives from different voters into a single consensus ranking. As a useful model for a variety of pract…
Exploiting Local Optimality in Metaheuristic Search
Fred Glover
A variety of strategies have been proposed for overcoming local optimality in metaheuristic search. This paper examines characteristics of moves that can be exploited to make good…
A Self-Organizing Extreme-Point Tabu-Search Algorithm for Fixed Charge Network Problems with Extensions
Richard S. Barr, Fred Glover, Toby Huskinson +1
We propose a new self-organizing algorithm for fixed-charge network flow problems based on ghost image (GI) processes as proposed in Glover (1994) and adapted to fixed-charge trans…
Bi-objective Optimization of Biclustering with Binary Data
Fred Glover, Said Hanafi, Gintaras Palubeckis
Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria. This paper addresses a generalization called quasi-clustering t…
Quantum Bridge Analytics II: Network Optimization and Combinatorial Chaining for Asset Exchange
Fred Glover, Gary Kochenberger, Moses Ma +1
Quantum Bridge Analytics relates to methods and systems for hybrid classical-quantum computing, and is devoted to developing tools for bridging classical and quantum computing to g…
Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis
Mark Lewis, Fred Glover
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a v…
Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems
Fred Glover, Mark Lewis, Gary Kochenberger
The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory an…
Memetic search for identifying critical nodes in sparse graphs
Yangming Zhou, Jin-Kao Hao, Fred Glover
Critical node problems involve identifying a subset of critical nodes from an undirected graph whose removal results in optimizing a pre-defined measure over the residual graph. As…
A History of Metaheuristics
Kenneth Sorensen, Marc Sevaux, Fred Glover
This chapter describes the history of metaheuristics in five distinct periods, starting long before the first use of the term and ending a long time in the future.
Diversification-Based Learning in Computing and Optimization
Fred Glover, Jin-Kao Hao
Diversification-Based Learning (DBL) derives from a collection of principles and methods introduced in the field of metaheuristics that have broad applications in computing and opt…
A Tabu Search based clustering algorithm and its parallel implementation on Spark
Yinhao Lu, Buyang Cao, Cesar Rego +1
The well-known K-means clustering algorithm has been employed widely in different application domains ranging from data analytics to logistics applications. However, the K-means al…
Diversification Methods for Zero-One Optimization
Fred Glover
We introduce new diversification methods for zero-one optimization that significantly extend strategies previously introduced in the setting of metaheuristic search. Our methods in…
Pseudo-Centroid Clustering
Fred Glover
Pseudo-Centroid Clustering replaces the traditional concept of a centroid expressed as a center of gravity with the notion of a pseudo-centroid (or a coordinate free centroid) whic…
Narrow Gauge and Analytical Branching Strategies for Mixed Integer Programming
Fred Glover, Vladimir Shylo, Oleg Shylo
State-of-the-art branch and bound algorithms for mixed integer programming make use of special methods for making branching decisions. Strategies that have gained prominence includ…
Path Relinking for Bandwidth Coloring Problem
Xiangjing Lai, Zhipeng Lu, Jin-Kao Hao +2
A Path Relinking algorithm is proposed for the Bandwidth Coloring problem and the Bandwidth MultiColoring problem. It combines a population based relinking method and a tabu search…
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs
Fred Glover, Tao Ye, Abraham P. Punnen +1
The bipartite boolean quadratic programming problem (BBQP) is a generalization of the well studied boolean quadratic programming problem. The model has a variety of real life appli…
Solving the minimum sum coloring problem via binary quadratic programming
Yang Wang, Jin-Kao Hao, Fred Glover +1
In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using t…