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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems with applications Jg. 158; S. 113613
Hauptverfasser:	Huerta, Isaías I., Neira, Daniel A., Ortega, Daniel A., Varas, Vicente, Godoy, Julio, Asín-Achá, Roberto
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 15.11.2020 Elsevier BV
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!