The unconstrained binary quadratic programming problem: a survey

In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompas...

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial optimization Vol. 28; no. 1; pp. 58 - 81
Main Authors: Kochenberger, Gary, Hao, Jin-Kao, Glover, Fred, Lewis, Mark, Lü, Zhipeng, Wang, Haibo, Wang, Yang
Format: Journal Article
Language:English
Published: Boston Springer US 01.07.2014
Springer Verlag
Subjects:
Combinatorics
Computer Science
Convex and Discrete Geometry
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
Unconstrained binary quadratic programs
Combinatorial optimization
Metaheuristics
ISSN:1382-6905, 1573-2886
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompasses a rich collection of problem types. In this paper we survey the literature on this important model, providing an overview of the applications and solution methods.
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-014-9734-0