Journal of Combinatorial Optimization

The unconstrained binary quadratic programming problem: a survey

Gary A. Kochenberger, Jin‐Kao Hao, Fred Glover, Mark W. Lewis, Zhipeng Lü, Haibo Wang, Yang Wang

Published Apr 17, 2014• 479 citations

Related papers

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem

Geraldo Regis Mauri, Luiz Antônio Nogueira Lorena

A Hybrid Heuristic for Solving Unconstrained Binary Quadratic Programming Problems.

Kien Ming Ng

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Shenshen Gu, Rui Cui, Peng Jiao

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

Kengo Katayama, Hiroyuki Narihisa

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Peter Merz, Bernd Freisleben

Solving unconstrained binary quadratic programming using binary particle swarm optimization

Geng Lin