Anytime automatic algorithm selection for knapsack

•New “Anytime” Framework for Automatic Algorithm Selection.•Application of the Anytime Automatic Algorithm Selection Framework to Knapsack.•3 Machine Learning Models proposed for the Problem.•Knapsack Instances, Features and Solvers Behavior publicly available. In this paper, we present a new approa...

Celý popis

Podrobná bibliografia

Vydané v:	Expert systems with applications Ročník 158; s. 113613
Hlavní autori:	Huerta, Isaías I., Neira, Daniel A., Ortega, Daniel A., Varas, Vicente, Godoy, Julio, Asín-Achá, Roberto
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 15.11.2020 Elsevier BV
Predmet:	Algorithm selection problem Algorithms Anytime behaviour approach Knapsack Knapsack problem Machine learning Machine learning techniques Solvers Anytime behaviour approach Machine learning techniques Knapsack Algorithm selection problem
ISSN:	0957-4174, 1873-6793
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!