A new class of hard problem instances for the 0-1 knapsack problem
From MaRDI portal
Publication:2140267
Recommendations
Cites work
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A New Algorithm for the 0-1 Knapsack Problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- A survey for the quadratic assignment problem
- Algorithm runtime prediction: methods \& evaluation
- An Algorithm for Large Zero-One Knapsack Problems
- An expanding-core algorithm for the exact 0-1 knapsack problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Approximation algorithms for knapsack problems with cardinality constraints
- Certification of an optimal TSP tour through 85,900 cities
- Discrete-variable extremum problems
- 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 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Instance spaces for machine learning classification
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Measuring instance difficulty for combinatorial optimization problems
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- The Knapsack Problem with Conflict Graphs
- The quadratic assignment problem
- The traveling salesman problem. A computational study.
- The TSP phase transition
- Towards objective measures of algorithm performance across instance space
- Where are the hard knapsack problems?
- Yet harder knapsack problems
Cited in
(15)- Evolution of new algorithms for the binary knapsack problem
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Evolving test instances of the Hamiltonian completion problem
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- scientific article; zbMATH DE number 2059840 (Why is no real title available?)
- 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
- A practical approach for dealing with hard knapsack problems using general-purpose integer programming software
- Learning primal heuristics for 0-1 knapsack interdiction problems
- Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
- Machine scheduling instance generation by reverse engineering from instance space analysis
- Algorithms and complexity results for the 0-1 knapsack problem with group fairness
- Mixed-integer linear programming approximations for the stochastic knapsack
This page was built for publication: A new class of hard problem instances for the 0-1 knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140267)
