11 citations · 47 across the 48 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Lattice simplices with a fixed positive number of interior lattice points: A nearly optimal volume bound
Gennadiy Averkov, Jan Krümpelmann, Benjamin Nill
We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound o…
math.OC2017★ 5 cited
Approximation of corner polyhedra with families of intersection cuts
Gennadiy Averkov, Amitabh Basu, Joseph Paat
We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in . In particular, we look at the prob…