Gennadiy Averkov

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 23

Top Topics

Top Venues

Discret. Comput. Geom.

Publications

Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny
The role of rationality in integer-programming relaxations. Math. Program. 205 (1) (2024)
Gennadiy Averkov, Matthias Schymura
On the maximal number of columns of a Δ-modular integer matrix: bounds and computations. Math. Program. 206 (1) (2024)
Gennadiy Averkov, Christopher Hojny, Matthias Schymura
Computational aspects of relaxation complexity: possibilities and limitations. Math. Program. 197 (2) (2023)
Gennadiy Averkov, Christopher Hojny, Matthias Schymura
Efficient MIP techniques for computing the relaxation complexity. Math. Program. Comput. 15 (3) (2023)
Gennadiy Averkov, Matthias Schymura
Complexity of linear relaxations in integer programming. Math. Program. 194 (1) (2022)
Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny
The role of rationality in integer-programming relaxations. CoRR (2022)
Emily Speakman, Gennadiy Averkov
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes. Discret. Appl. Math. 308 (2022)
Gennadiy Averkov, Matthias Schymura
On the Maximal Number of Columns of a $\varDelta $-modular Matrix. IPCO (2022)
Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel
Sparse representation of vectors in lattices and semigroups. Math. Program. 192 (1) (2022)
Gennadiy Averkov, Christopher Borger, Ivan Soprunov
Classification of Triples of Lattice Polytopes with a Given Mixed Volume. Discret. Comput. Geom. 66 (1) (2021)
Gennadiy Averkov, Christopher Hojny, Matthias Schymura
Computational Aspects of Relaxation Complexity. IPCO (2021)
Gennadiy Averkov
Equality Case in van der Corput's Inequality and Collisions in Multiple Lattice Tilings. Discret. Comput. Geom. 65 (1) (2021)
Gennadiy Averkov, Giulia Codenotti, Antonio Macchia, Francisco Santos
A local maximizer for lattice width of 3-dimensional hollow bodies. Discret. Appl. Math. 298 (2021)
Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel
Optimizing Sparsity over Lattices and Semigroups. IPCO (2020)
Gennadiy Averkov
Local optimality of Zaks-Perles-Wills simplices. Adv. Appl. Math. 112 (2020)
Gennadiy Averkov
Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization. SIAM J. Appl. Algebra Geom. 3 (1) (2019)
Gennadiy Averkov, Amitabh Basu, Joseph Paat
Approximation of Corner Polyhedra with Families of Intersection Cuts. SIAM J. Optim. 28 (1) (2018)
Gennadiy Averkov, Volker Kaibel, Stefan Weltge
Maximum semidefinite and linear extension complexity of families of polytopes. Math. Program. 167 (2) (2018)
Gennadiy Averkov, Bernardo González Merino, Ingo Paschke, Matthias Schymura, Stefan Weltge
Tight bounds on discrete quantitative Helly numbers. Adv. Appl. Math. 89 (2017)
Gennadiy Averkov, Amitabh Basu, Joseph Paat
Approximation of Corner Polyhedra with Families of Intersection Cuts. IPCO (2017)
Gennadiy Averkov, Jan Krümpelmann, Stefan Weltge
Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three. Math. Oper. Res. 42 (4) (2017)
Gennadiy Averkov, Volker Kaibel, Stefan Weltge
Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes. CoRR (2016)
Gennadiy Averkov, Barbara Langfeld
Homometry and Direct-Sum Decompositions of Lattice-Convex Sets. Discret. Comput. Geom. 56 (1) (2016)
Gennadiy Averkov, Amitabh Basu
Lifting properties of maximal lattice-free polyhedra. Math. Program. 154 (1-2) (2015)
Gennadiy Averkov, Amitabh Basu
On the Unique-Lifting Property. IPCO (2014)
Gennadiy Averkov
Constructive Proofs of some Positivstellensätze for Compact Semialgebraic Subsets of ℝ d. J. Optim. Theory Appl. 158 (2) (2013)
Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. 27 (3) (2013)
Gennadiy Averkov
On Maximal S-Free Sets and the Helly Number for the Family of S-Convex Sets. SIAM J. Discret. Math. 27 (3) (2013)
Gennadiy Averkov, Barbara Langfeld
On the Reconstruction of Planar Lattice-Convex Sets from the Covariogram. Discret. Comput. Geom. 48 (1) (2012)
Gennadiy Averkov
On finitely generated closures in the theory of cutting planes. Discret. Optim. 9 (4) (2012)
Gennadiy Averkov
On the Size of Lattice Simplices with a Single Interior Lattice Point. SIAM J. Discret. Math. 26 (2) (2012)
Gennadiy Averkov, Martin Henk
polynomials. Math. Program. 126 (2) (2011)
Gennadiy Averkov, Christian Wagner, Robert Weismantel
Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three. Math. Oper. Res. 36 (4) (2011)
Gennadiy Averkov
Detecting and reconstructing centrally symmetric sets from the autocorrelation: Two discrete cases. Appl. Math. Lett. 22 (9) (2009)
Gennadiy Averkov, Martin Henk
Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities. Discret. Comput. Geom. 42 (2) (2009)
Gennadiy Averkov, Horst Martini
On pyramids and reducedness. Period. Math. Hung. 57 (2) (2008)