3 papers
math.OC2020
A polynomial algorithm for minimizing discrete convic functions in fixed dimension
S. I. Veselov, D. V. Gribanov, N. Yu. Zolotykh +1
Recently classes of conic and discrete conic functions were introduced. In this paper we use the term convic instead conic. The class of convic functions properly includes the clas…
math.CO2019
All 2-neighborly d-polytopes with at most d + 9 facets
Aleksandr N. Maksimenko, Dmitry V. Gribanov, Dmitry S. Malyshev
We give a complete enumeration of all 2-neighborly -polytopes with and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope with 10 ve…
math.OC2017
FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems
D. V. Gribanov
In this paper, we present FPT-algorithms for special cases of the shortest vector problem (SVP) and the integer linear programming problem (ILP), when matrices included to the prob…