12 citations · 29 across the 4 of their papers we have counts for
4 papers
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…
On the complexity of quasiconvex integer minimization problem
A. Yu. Chirkov, D. V. Gribanov, D. S. Malyshev +3
In this paper, we consider the class of quasiconvex functions and its proper subclass of conic functions. The integer minimization problem of these functions is considered in the p…
The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices
D. V. Gribanov, A. Y. Chirkov
In this paper, we will show that the width of simplices defined by systems of linear inequalities can be computed in polynomial time if some minors of their constraint matrices are…
On the number of irreducible points in polyhedra
A. Yu. Chirkov, N. Yu. Zolotykh
An integer point in a polyhedron is called irreducible iff it is not the midpoint of two other integer points in the polyhedron. We prove that the number of irreducible integer poi…