Solving the knapsack problem via
- 31 December 2002
- journal article
- research article
- Published by Elsevier BV in Operations Research Letters
- Vol. 30 (6), 394-400
- https://doi.org/10.1016/s0167-6377(02)00161-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Laplace transform algorithm for the volume of a convex polytopeJournal of the ACM, 2001
- Solving a class of multivariate integration problems via Laplace techniquesApplicationes Mathematicae, 2001
- Residue formulae, vector partition functions and lattice points in rational polytopesJournal of the American Mathematical Society, 1997
- Lattice points in simple polytopesJournal of the American Mathematical Society, 1997
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency DeterminationINFORMS Journal on Computing, 1997
- Attacking the Chor-Rivest Cryptosystem by Improved Lattice ReductionLecture Notes in Computer Science, 1995
- A hard knapsack problemNaval Research Logistics (NRL), 1988
- Functions of One Complex Variable IGraduate Texts in Mathematics, 1978