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

9 citations · 14 across the 8 of their papers we have counts for

collaborators
Showing cs.AIShow all

5 papers · 1 filter

cs.AI2020

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…

cs.AI20201 cited

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…

cs.AI20173 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.AI20171 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…