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

The unconstrained binary quadratic programming problem (BQP) is known to be NP-hard and has many practical applications. This paper presents a simulated annealing (SA)-based heuristic for the BQP. The new SA heuristic for the BQP is based on a simple (1-opt) local search heuristic and designed with...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 134; no. 1; pp. 103 - 119
Main Authors:	Katayama, Kengo, Narihisa, Hiroyuki
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.10.2001 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Algorithms Heuristic Heuristics Large-size problems Local search Mathematical programming Quadratic programming Searches Simulated annealing Simulation Studies Unconstrained binary quadratic programming Local search Unconstrained binary quadratic programming Heuristics Large-size problems Simulated annealing
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!