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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 134; číslo 1; s. 103 - 119
Hlavní autori:	Katayama, Kengo, Narihisa, Hiroyuki
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.10.2001 Elsevier Elsevier Sequoia S.A
Edícia:	European Journal of Operational Research
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!