Gennadiy Averkov

发表

Approximation of Corner Polyhedra with Families of Intersection Cuts

Amitabh Basu, Joseph Paat, Gennadiy Averkov, 2017, IPCO.

Optimizing Sparsity over Lattices and Semigroups

Iskander Aliev, Timm Oertel, Gennadiy Averkov, 2019, Conference on Integer Programming and Combinatorial Optimization.

Representing simple d-dimensional polytopes by d polynomials

Martin Henk, Gennadiy Averkov, M. Henk, 2007, Math. Program..

Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities

Martin Henk, Gennadiy Averkov, 2009, Discret. Comput. Geom..

Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three

Stefan Weltge, Gennadiy Averkov, Jan Krümpelmann, 2017, Math. Oper. Res..

On pyramids and reducedness

Horst Martini, Gennadiy Averkov, 2008, Period. Math. Hung..

Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three

Robert Weismantel, Gennadiy Averkov, Christian Wagner, 2010, Math. Oper. Res..

Tight bounds on discrete quantitative Helly numbers

Stefan Weltge, Bernardo González Merino, Gennadiy Averkov, 2017, Adv. Appl. Math..

Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization

Gennadiy Averkov, G. Averkov, 2018, SIAM J. Appl. Algebra Geom..

Maximum semidefinite and linear extension complexity of families of polytopes

Volker Kaibel, Stefan Weltge, Gennadiy Averkov, 2018, Math. Program..

Local optimality of Zaks-Perles-Wills simplices

Gennadiy Averkov, G. Averkov, 2018, Adv. Appl. Math..

On the Unique-Lifting Property

Amitabh Basu, Gennadiy Averkov, 2014, IPCO.

On the Reconstruction of Planar Lattice-Convex Sets from the Covariogram

Gennadiy Averkov, Barbara Langfeld, G. Averkov, 2010, Discret. Comput. Geom..

Approximation of Corner Polyhedra with Families of Intersection Cuts

Amitabh Basu, Joseph Paat, Gennadiy Averkov, 2018, SIAM J. Optim..

On the Size of Lattice Simplices with a Single Interior Lattice Point

Gennadiy Averkov, 2012, SIAM J. Discret. Math..

Equality Case in van der Corput’s Inequality and Collisions in Multiple Lattice Tilings

Gennadiy Averkov, 2021, Discret. Comput. Geom..

Lifting properties of maximal lattice-free polyhedra

Amitabh Basu, Gennadiy Averkov, A. Basu, 2014, Mathematical programming.

Homometry and Direct-Sum Decompositions of Lattice-Convex Sets

Gennadiy Averkov, Barbara Langfeld, G. Averkov, 2014, Discret. Comput. Geom..

Convexification of polynomial optimization problems by means of monomial patterns

Sebastian Sager, Gennadiy Averkov, Benjamin Peters, 2019 .

On the Convergence of the Affine Hull of the Chvátal-Gomory Closures

Marco Di Summa, Michele Conforti, Alberto Del Pia, 2012, SIAM J. Discret. Math..

Constructive Proofs of some Positivstellensätze for Compact Semialgebraic Subsets of ℝd

Gennadiy Averkov, G. Averkov, 2013, J. Optim. Theory Appl..

Detecting and reconstructing centrally symmetric sets from the autocorrelation: Two discrete cases

Gennadiy Averkov, G. Averkov, 2009, Appl. Math. Lett..

On finitely generated closures in the theory of cutting planes

Gennadiy Averkov, 2012, Discret. Optim..

On Maximal S-Free Sets and the Helly Number for the Family of S-Convex Sets

Gennadiy Averkov, G. Averkov, 2011, SIAM J. Discret. Math..

On the maximal number of columns of a $\Delta$-modular matrix

Gennadiy Averkov, Matthias Schymura, 2021 .

Sharp bounds on fake weighted projective spaces with canonical singularities

Gennadiy Averkov, Benjamin Nill, Alexander Kasprzyk, 2021 .

Pl\"ucker-type inequalities for mixed areas and intersection numbers of curve arrangements

Ivan Soprunov, Gennadiy Averkov, 2021 .

Classification of Triples of Lattice Polytopes with a Given Mixed Volume

Ivan Soprunov, Gennadiy Averkov, Christopher Borger, 2019, Discrete & Computational Geometry.

A local maximizer for lattice width of 3-dimensional hollow bodies

Francisco Santos, Antonio Macchia, Gennadiy Averkov, 2019, Discret. Appl. Math..

A remark on the approximation of non-negative polynomials by SONC polynomials

Gennadiy Averkov, 2021 .

Computational aspects of relaxation complexity: possibilities and limitations

Christopher Hojny, Gennadiy Averkov, Matthias Schymura, 2021, Mathematical Programming.

Generalized flatness constants, spanning lattice polytopes, and the Gromov width

Gennadiy Averkov, Benjamin Nill, Johannes Hofscheier, 2019, manuscripta mathematica.

Sparse representation of vectors in lattices and semigroups

Iskander Aliev, Timm Oertel, Gennadiy Averkov, 2021, Math. Program..

Computational Aspects of Relaxation Complexity

Christopher Hojny, Gennadiy Averkov, Matthias Schymura, 2021, IPCO.

Transversal numbers over subsets of linear spaces

Robert Weismantel, Gennadiy Averkov, R. Weismantel, 2010, 1002.0948.

A proof of Lovász’s theorem on maximal lattice-free sets

Gennadiy Averkov, G. Averkov, 2011 .

Confirmation of Matheron's conjecture on the covariogram of a planar convex body

Gabriele Bianchi, Gennadiy Averkov, G. Bianchi, 2007, 0711.0572.

On finite generation and infinite convergence of generalized closures from the theory of cutting planes

Gennadiy Averkov, G. Averkov, 2011, 1106.1526.