On the public citation graph
On integer points in polyhedra: A lower bound
0 signed · 43 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0166-218x(83)90067-7openalex-snapshot
The vertices of the knapsack polytope
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1287/opre.18.5.940openalex-snapshot
On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11774938_23openalex-snapshot
Computational Aspects of Digital Plane and Hyperplane Recognition
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_13openalex-snapshot
An Improved Upper Bound on the Size of Planar Convex-Hulls
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_5openalex-snapshot
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_14openalex-snapshot
Integer Programming and Algorithmic Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-10210-3_2openalex-snapshot
On the Convex Hull of the Integer Points in a Bi-circular Region
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_8openalex-snapshot
Approximation by Convex Polytopes
inferred← citeshttps://doi.org/10.1007/s002080050217openalex-snapshot
The convex hull of the integer points in a large ball
inferred← citeshttps://doi.org/10.1007/s00373-016-1683-1openalex-snapshot
On the Number of Irreducible Points in Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-003-0836-1openalex-snapshot
The Randomized Integer Convex Hull
inferred← citeshttps://doi.org/10.1007/s100920170009openalex-snapshot
Gradient elements of the knapsack polytope
inferred← citeshttps://doi.org/10.1007/s10851-017-0711-yopenalex-snapshot
About the Decidability of Polyhedral Separability in the Lattice $$\mathbb {Z}^d$$ Z d
inferred← citeshttps://doi.org/10.1007/s10958-008-9144-xopenalex-snapshot
Approximation of convex sets by polytopes
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90058-6openalex-snapshot
On the maximal number of edges of convex digital polygons included into an m × m-grid
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.022openalex-snapshot
Some theoretical challenges in digital geometry: A perspective
inferred← citeshttps://doi.org/10.1016/j.orl.2015.03.002openalex-snapshot
Note on the complexity of the mixed-integer hull of a polyhedron
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.07.014openalex-snapshot
On the polyhedral complexity of the integer points in a hyperball
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12004-0openalex-snapshot
Integer Programming, Lattices, and Results in Fixed Dimension
inferred← citeshttps://doi.org/10.1090/s0273-0979-08-01210-xopenalex-snapshot
Random points and lattice points in convex bodies
inferred← citeshttps://doi.org/10.1112/s0025579300006665openalex-snapshot
Upper and lower bound results on the convex hull of integer points in polyhedra
inferred← citeshttps://doi.org/10.1134/s1990478908040157openalex-snapshot
Some estimates for the number of vertices of integer polyhedra
inferred← citeshttps://doi.org/10.1137/0220044openalex-snapshot
On Counting Lattice Points in Polyhedra
inferred← citeshttps://doi.org/10.1137/21m139935xopenalex-snapshot
Enumerating Integer Points in Polytopes with Bounded Subdeterminants
inferred← citeshttps://doi.org/10.1145/109648.109666openalex-snapshot
On the convex hull of the integer points in a disc
inferred← citeshttps://doi.org/10.1145/180139.181124openalex-snapshot
Geometrical concept learning and convex polytopes
inferred← citeshttps://doi.org/10.1145/3421750openalex-snapshot
Polynomiality for Bin Packing with a Constant Number of Item Types
inferred← citeshttps://doi.org/10.1287/moor.1080.0320openalex-snapshot
Parametric Integer Programming in Fixed Dimension
inferred← citeshttps://doi.org/10.1287/moor.26.1.31.10590openalex-snapshot
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
inferred← citeshttps://doi.org/10.1287/moor.26.2.304.10555openalex-snapshot
Cutting Planes and the Elementary Closure in Fixed Dimension
inferred← citeshttps://doi.org/10.22028/d291-25909openalex-snapshot
Gomory-Chvátal cutting planes and the elementary closure of Polyhedra
inferred← citeshttps://doi.org/10.23919/ecc55457.2022.9838543openalex-snapshot
Distributed Optimization for Mixed-Integer Consensus in Multi-Agent Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1412.2520openalex-snapshot
Note on the Complexity of the Mixed-Integer Hull of a Polyhedron
inferred← citeshttps://doi.org/10.48550/arxiv.math/0611356openalex-snapshot
On the number of vertices in integer linear programming problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.