Lower and Upper Bounds for the Number of Lattice Points in a Simplex

Abstract

Previous article Next article Lower and Upper Bounds for the Number of Lattice Points in a SimplexAharon Gavriel Beged-dovAharon Gavriel Beged-dovhttps://doi.org/10.1137/0122012PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] A. G. Beged-Dov, Some computational aspects of the P printers M paper mills trim problem, Business Administration, 2 (1970), 15–34 Google Scholar[2] P. C. Gilmore and , R. E. Gomory, A linear programming approach to the cutting-stock problem, Operations Res., 9 (1961), 849–859 MR0137589 0096.35501 CrossrefISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Homotopy techniques for solving sparse column support determinantal polynomial systemsJournal of Complexity, Vol. 66 Cross Ref Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphsEuropean Journal of Combinatorics, Vol. 92 Cross Ref Polynomial Approximation of Anisotropic Analytic Functions of Several Variables16 July 2020 | Constructive Approximation, Vol. 51 Cross Ref Greedy approximations by signed harmonic sums and the Thue–Morse sequenceAdvances in Mathematics, Vol. 366 Cross Ref Sampling inequalities for anisotropic tensor product grids8 January 2019 | IMA Journal of Numerical Analysis, Vol. 107 Cross Ref Novel results for the anisotropic sparse grid quadratureJournal of Complexity, Vol. 47 Cross Ref On tensor product approximation of analytic functionsJournal of Approximation Theory, Vol. 207 Cross Ref Hyperbolic cross approximation in infinite dimensionsJournal of Complexity, Vol. 33 Cross Ref Rethinking the encounter probability for direct-to-target nuclear attacks for aviation security5 May 2011 | Journal of Transportation Security, Vol. 4, No. 3 Cross Ref Эффективные оценки производных обратной функцииИзвестия Российской академии наук. Серия математическая, Vol. 72, No. 4 Cross Ref Improved lower and upper bounds for the number of feasible solutions to a knapsaek problemOptimization, Vol. 19, No. 6 Cross Ref APPLICATION OF OPERATIONS RESEARCH IN PAPER PROCUREMENT Cross Ref The Number of Feasible Solutions to a Knapsack ProblemO. Achou12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 27, No. 4AbstractPDF (209 KB)Bounds on the Number of Feasible Solutions to a Knapsack ProblemThomas A. Lambe12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 26, No. 2AbstractPDF (229 KB)The Paper Trim Problem: A Variable Demand AnalysisA I I E Transactions, Vol. 6, No. 1 Cross Ref A Remark on “an Inequality for the Number of Lattice Points in a Simplex”Manfred W. Padberg12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 20, No. 4AbstractPDF (253 KB) Volume 22, Issue 1| 1972SIAM Journal on Applied Mathematics History Submitted:09 December 1969Published online:12 July 2006 InformationCopyright © 1972 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0122012Article page range:pp. 106-108ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics