Multi-wave tabu search for the boolean quadratic programming problem with generalized upper bound constraints

The boolean quadratic programming problem with generalized upper bound constraints (BQP-GUB) is an NP-hard problem with many practical applications. In this study, we propose an effective multi-wave tabu search algorithm for solving BQP-GUB. The algorithm performs a sequence of search waves, where e...

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & operations research Ročník 150; s. 106077
Hlavní autoři:	Shang, Zhen, Hao, Jin-Kao, Zhao, Songzheng, Wang, Yang, Ma, Fei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.02.2023 Elsevier
Témata:	Binary quadratic programming Computer Science Graph theory Hybrid metaheuristic Tabu search Graph theory Binary quadratic programming Tabu search Hybrid metaheuristic
ISSN:	0305-0548, 1873-765X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!