Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)

We present a family of local-search-based heuristics for Quadratic Unconstrained Binary Optimization (QUBO), all of which start with a (possibly fractional) initial point, sequentially improving its quality by rounding or switching the value of one variable, until arriving to a local optimum. The ef...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of heuristics Ročník 13; číslo 2; s. 99 - 132
Hlavní autori: Boros, Endre, Hammer, Peter L., Tavares, Gabriel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer Nature B.V 01.04.2007
Predmet:
Algorithms
Boolean
Heuristic
Integer programming
Mathematical models
Optimization
Studies
Variables
ISSN:1381-1231, 1572-9397
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present a family of local-search-based heuristics for Quadratic Unconstrained Binary Optimization (QUBO), all of which start with a (possibly fractional) initial point, sequentially improving its quality by rounding or switching the value of one variable, until arriving to a local optimum. The effects of various parameters on the efficiency of these methods are analyzed through computational experiments carried out on thousands of randomly generated problems having 20 to 2500 variables. Tested on numerous benchmark problems, the performance of the most competitive variant (ACSIOM) was shown to compare favorably with that of other published procedures. [PUBLICATION ABSTRACT]
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1381-1231
1572-9397
DOI:10.1007/s10732-007-9009-3