Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

In this paper, a greedy heuristic and two local search algorithms, 1-opt local search and k-opt local search, are proposed for the unconstrained binary quadratic programming problem (BQP). These heuristics are well suited for the incorporation into meta-heuristics such as evolutionary algorithms. Th...

Full description

Bibliographic Details

Published in:	Journal of heuristics Vol. 8; no. 2; pp. 197 - 213
Main Authors:	Merz, Peter, Freisleben, Bernd
Format:	Journal Article
Language:	English
Published:	Boston Springer Nature B.V 01.03.2002
Subjects:	Algorithms Boolean Capital budgeting Genetic algorithms Heuristic Mathematical programming Neighborhoods Optimization Quadratic programming Searches Studies
ISSN:	1381-1231, 1572-9397
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!