Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
From MaRDI portal
Publication:2027074
Recommendations
Cites work
- A hard knapsack problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A New Algorithm for the 0-1 Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- An expanding-core algorithm for the exact 0-1 knapsack problem
- Core problems in knapsack algorithms
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Generating new test instances by evolving in instance space
- Hard Knapsack Problems
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- scientific article; zbMATH DE number 1857683 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Instance spaces for machine learning classification
- InstanceSpace
- Matroidal relaxations for 0-1 knapsack problems
- Measuring instance difficulty for combinatorial optimization problems
- Needed: An Empirical Science of Algorithms
- On normalization and algorithm selection for unsupervised outlier detection
- Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
- Simple but efficient approaches for the collapsing knapsack problem
- Testing heuristics: We have it all wrong
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- The generation of experimental data for computational testing in optimization
- Tolerance analysis for 0-1 knapsack problems
- Towards objective measures of algorithm performance across instance space
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- Where are the hard knapsack problems?
Cited in
(21)- Where are the hard knapsack problems?
- Instance space analysis for a personnel scheduling problem
- Relating instance hardness to classification performance in a dataset: a visual approach
- Evolving test instances of the Hamiltonian completion problem
- A new class of hard problem instances for the 0-1 knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Enhanced instance space analysis for the maximum flow problem
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Instance space analysis for 2D bin packing mathematical models
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- Instance space analysis for the car sequencing problem
- A practical approach for dealing with hard knapsack problems using general-purpose integer programming software
- A block-building constraint programming model for the container loading problem
- Solving hard bi-objective knapsack problems using deep reinforcement learning
- Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
- Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
- A novel dynamic programming heuristic for the quadratic knapsack problem
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
- Machine scheduling instance generation by reverse engineering from instance space analysis
This page was built for publication: Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2027074)
