Bounds on the Number of Feasible Solutions to a Knapsack Problem

DOI10.1137/0126027zbMath0281.90046OpenAlexW2076825611MaRDI QIDQ4766798

Thomas A. Lambe

Publication date: 1974

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0126027

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

On multiplicative independence of rational function iterates ⋮ An algorithm for the 0/1 Knapsack problem ⋮ ON CONSTRUCTION OF HIGH ORDER ELEMENTS IN ARBITRARY FINITE FIELDS

This page was built for publication: Bounds on the Number of Feasible Solutions to a Knapsack Problem