scientific article; zbMATH DE number 3876925
From MaRDI portal
Publication:3342214
Recommendations
Cited in
(18)- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- On equivalent knapsack problems
- Testing integer knapsacks for feasibility
- LLL-reduction for integer knapsacks
- Polynomial size IP formulations of knapsack may require exponentially large coefficients
- A polynomial-time algorithm for knapsack with divisible item sizes
- scientific article; zbMATH DE number 7401920 (Why is no real title available?)
- scientific article; zbMATH DE number 4005976 (Why is no real title available?)
- scientific article; zbMATH DE number 4031399 (Why is no real title available?)
- Decision problems for some classes of integer partitions and number multisets
- A note on the solution of group knapsack problems
- scientific article; zbMATH DE number 710573 (Why is no real title available?)
- scientific article; zbMATH DE number 2059840 (Why is no real title available?)
- scientific article; zbMATH DE number 6861894 (Why is no real title available?)
- scientific article; zbMATH DE number 2086933 (Why is no real title available?)
- A polynomially solvable special case of the unbounded knapsack problem
- Generic polynomial algorithms for the knapsack problem in some matrix semigroups
- Sums of lexicographically ordered sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342214)