Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
type: Item
instance of: scholarly article
title: Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
author: Kate A. Smith-Miles
author: Jeffrey Christiansen
author: Mario Andrés Muñoz
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350570
zbMATH Keywords: 0-1 knapsack problem
zbMATH Keywords: instance space analysis
zbMATH Keywords: instance generation
zbMATH Keywords: instance difficulty
zbMATH Keywords: performance evaluation
zbMATH Keywords: algorithm portfolios
zbMATH Keywords: algorithm selection
cites work: InstanceSpace
cites work: Matroidal relaxations for 0-1 knapsack problems
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
cites work: A hard knapsack problem
cites work: Hard Knapsack Problems
cites work: Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
cites work: The Generation of Experimental Data for Computational Testing in Optimization
cites work: The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
cites work: Needed: An Empirical Science of Algorithms
cites work: Testing heuristics: We have it all wrong
cites work: On normalization and algorithm selection for unsupervised outlier detection
cites work: Q4821303
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Q4788644
cites work: Instance spaces for machine learning classification
cites work: Simple but efficient approaches for the collapsing knapsack problem
cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
cites work: Core problems in knapsack algorithms
cites work: Where are the hard knapsack problems?
cites work: Q4247440
cites work: Tolerance analysis for 0-1 knapsack problems
cites work: Generating new test instances by evolving in instance space
cites work: Measuring instance difficulty for combinatorial optimization problems
cites work: Towards objective measures of algorithm performance across instance space
describes a project that uses: InstanceSpace
describes a project that uses: SPOT
describes a project that uses: MATILDA
describes a project that uses: outselect
describes a project that uses: Knapsack
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105184
OpenAlex ID: W3111603006
DOI: 10.1016/J.COR.2020.105184
description: scientific article; zbMATH DE number 7350570