The Number of Feasible Solutions to a Knapsack Problem

DOI10.1137/0127050zbMATH Open0293.90029OpenAlexW2069490777MaRDI QIDQ4045873FDOQ4045873

Authors: Oussama Achou 

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/0127050

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited In (1)

• Improved lower and upper bounds for the number of feasible solutions to a knapsaek problem

This page was built for publication: The Number of Feasible Solutions to a Knapsack Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045873)