A new lower bound for the linear knapsack problem with general integer variables
From MaRDI portal
(Redirected from Publication:859686)
Recommendations
- scientific article; zbMATH DE number 4093178
- A note on a general nonlinear knapsack problem
- An algorithm for the continuous variable upper bound knapsack problem
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A new enumeration scheme for the knapsack problem
- A polynomially solvable special case of the unbounded knapsack problem
- Canonical Coin Changing and Greedy Solutions
- Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem
- On dominated terms in the general knapsack problem
- When the Greedy Solution Solves a Class of Knapsack Problems
Cited in
(5)- Unbounded knapsack problems with arithmetic weight sequences
- Determining the K-best solutions of knapsack problems
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
- An algorithm for the continuous variable upper bound knapsack problem
This page was built for publication: A new lower bound for the linear knapsack problem with general integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859686)
