Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 19, 1988 - Issue 6
24
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

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

Pages 889-894 | Received 01 Oct 1987, Published online: 27 Jun 2007

References

  • Achou , O. 1974 . The number of feasible solutions to a knapsack problem . SIAM J. Appl. Math , 27 : 606 – 610 .
  • Dov , A.G. 1972 . Lower and upper bounds for the number of lattice points in a simplex . SIAM J. Appl. Math , 22 : 106 – 108 .
  • Hadwigeb , H. 1957 . Vorlesungen über Inhalt, Oberfläche und Isoperimetric , Berlin : Springer .
  • Padbebg , M.W. 1971 . A remark on an inequality for the number of lattice points in a simplex . SIAM J. Appl. Math , 20 : 638 – 641 .
  • Piehler , J. 1978 . Bemerkung zu einer Arbeit von ACHOU über die Anzahl zulässiger Lösungen eines Knapsack-problems . Math. Operationsforsch. Statist., Ser. Optimization , 9 : 167 – 170 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.