Algorithm Portfolios for Solving the Quadratic Assignment Problem

Introduction. The quadratic assignment problem is a well-established NP-hard problem in combinatorial optimization with applications in diverse fields like economics, archaeology, and chemistry. Due to its complexity, research on efficient solution methods remains active, including efforts for paral...

詳細記述

書誌詳細

主要な著者:	Ivan Sergienko, Volodymyr Shylo, Valentyna Roshchyn, Petro Shylo, Dmytro Boyarchuk, Valerii Moroz
フォーマット:	Artigo
言語:	Inglês
出版事項:	V.M. Glushkov Institute of Cybernetics 2024-09-01
シリーズ:	Кібернетика та комп'ютерні технології
主題:	quadratic assignment problem algorithm portfolios experimental research algorithm portfolios efficiency
オンライン･アクセス:	http://cctech.org.ua/13-vertikalnoe-menyu-en/612-abstract-24-3-3-arte
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!