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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 134; H. 1; S. 103 - 119
Hauptverfasser:	Katayama, Kengo, Narihisa, Hiroyuki
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.10.2001 Elsevier Elsevier Sequoia S.A
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!