Solving the knapsack problem via \(\mathbb Z\)-transform

DOI10.1016/S0167-6377(02)00161-XzbMath1022.90019OpenAlexW2163022821MaRDI QIDQ1870019

Eduardo S. Zeron, Jean-Bernard Lasserre

Publication date: 4 May 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00161-x

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

A discrete Farkas lemma, Effective lattice point counting in rational convex polytopes, Computing Optimized Path Integrals for Knapsack Feasibility, Polyhedral circuits and their applications

Cites Work

• A Laplace transform algorithm for the volume of a convex polytope
• A hard knapsack problem
• Lattice points in simple polytopes
• A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
• Residue formulae, vector partition functions and lattice points in rational polytopes
• Solving a class of multivariate integration problems via Laplace techniques
• On Counting Integral Points in a Convex Rational Polytope
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item