f-Flip strategies for unconstrained binary quadratic programming

Unconstrained binary quadratic programming (UBQP) provides a unifying modeling and solution framework for solving a remarkable range of binary optimization problems, including many accompanied by constraints. Current methods for solving UBQP problems customarily rely on neighborhoods consisting of f...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 238; no. 1-2; pp. 651 - 657
Main Authors:	Glover, Fred, Hao, Jin-Kao
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2016 Springer Springer Nature B.V Springer Verlag
Subjects:	Algorithms Business and Management CAD Combinatorics Computer aided design Computer Science Mathematical research Operations research Operations Research/Decision Theory Optimization Quadratic programming Studies Theory of Computation Variables Multi-start algorithms Binary quadratic programming Computational efficiency Metaheuristics 0–1 Optimization metaheuristics
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!