A new lower bound for the linear knapsack problem with general integer variables
From MaRDI portal
Publication:859686
DOI10.1016/J.EJOR.2006.02.018zbMATH Open1163.90716OpenAlexW2013441581MaRDI QIDQ859686FDOQ859686
Authors: Kamlesh Mathur, Prahalad Venkateshan 
Publication date: 16 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.018
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- When the Greedy Solution Solves a Class of Knapsack Problems
- Canonical Coin Changing and Greedy Solutions
- A new enumeration scheme for the knapsack problem
- A polynomially solvable special case of the unbounded knapsack problem
- On dominated terms in the general knapsack problem
- Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem
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
Uses Software
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)
