A study on the effects of normalized TSP features for automated algorithm selection

Classic automated algorithm selection (AS) for (combinatorial) optimization problems heavily relies on so-called instance features, i.e., numerical characteristics of the problem at hand ideally extracted with computationally low-demanding routines. For the traveling salesperson problem (TSP) a plet...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 940; s. 123 - 145
Hlavní autori:	Heins, Jonathan, Bossek, Jakob, Pohl, Janina, Seiler, Moritz, Trautmann, Heike, Kerschke, Pascal
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 09.01.2023
Predmet:	Algorithm selection Feature normalization Traveling salesperson problem Algorithm selection Feature normalization Traveling salesperson problem
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!