activity
20132022
most citedSolving the minimum sum coloring problem via binary quadratic programming

9 citations · 28 across the 15 of their papers we have counts for

collaborators
Showing 2017Show all

7 papers · 1 filter

cs.AI2017★ 3 cited

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…

cs.AI2017

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…

cs.AI2017★ 2 cited

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…

cs.AI2017

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.

cs.AI2017★ 1 cited

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…

cs.DC2017★ 4 cited

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…

cs.AI2017

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…