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

Full description

Bibliographic Details

Published in:	Expert systems with applications Vol. 158; p. 113613
Main Authors:	Huerta, Isaías I., Neira, Daniel A., Ortega, Daniel A., Varas, Vicente, Godoy, Julio, Asín-Achá, Roberto
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 15.11.2020 Elsevier BV
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!