Hard Knapsack Problems
From MaRDI portal
Cited in
(47)- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- Exact methods for the knapsack problem and its generalizations
- A new enumeration scheme for the knapsack problem
- The knapsack problem with generalized upper bounds
- Heuristics and their design: A survey
- Solving dense subset-sum problems by using analytical number theory
- Pseudopolynomial algorithms for the solution of backpack problems
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Some thoughts on combinatorial optimisation
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- A new fully polynomial time approximation scheme for the interval subset sum problem
- Thinner is not always better: cascade knapsack problems
- Measuring instance difficulty for combinatorial optimization problems
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem
- A new class of hard problem instances for the 0-1 knapsack problem
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- Simple lifted cover inequalities and hard knapsack problems
- Lower bounds on the size of general branch-and-bound trees
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- A solution method for a knapsack problem and its variant
- Toward a model for backtracking and dynamic programming
- Multivariable Branching: A 0-1 Knapsack Problem Case Study
- A stronger model of dynamic programming algorithms
- An exact algorithm for the subset sum problem
- Branch-and-bound solves random binary IPs in poly(n)-time
- Compressing branch-and-bound trees
- A theoretical and computational analysis of full strong-branching
- Complexity of optimizing over the integers
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Advice complexity of adaptive priority algorithms
- A hard problem that is almost always easy
- Yet harder knapsack problems
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Compressing branch-and-bound trees
- Branching with a pre-specified finite list of k-sparse split sets for binary MIPs
- Branch-and-bound algorithms as polynomial-time approximation schemes
- A note on the complexity of a partition algorithm
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
- Column basis reduction and decomposable knapsack problems
- Bounds on the size of branch-and-bound proofs for integer knapsacks
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- On exponential time lower bound of Knapsack under backtracking
- Using modifications to Grover's search algorithm for quantum global optimization
This page was built for publication: Hard Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893671)
