15 citations · 38 across the 7 of their papers we have counts for
7 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…
FPT-algorithms for some problems related to integer programming
D. V. Gribanov, D. S. Malyshev, P. M. Pardalos +1
In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices include…
On integer programing with bounded determinants
Dmitry Gribanov, Sergey Veselov
Let be an integral matrix, and let be an -dimensional polytope. The width of is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus…
Bounds for solution of linear diophantine equations
S. I. Veselov
Given linear diophantine equation Ax=b, rank A=m. Let d be the maximum of absolute values of the mxm minors of the matrix (A | b). It is shown that if M={x : Ax=b, x nonnegative an…
On reduction integer programs to knapsack problem
S. I. Veselov
Let be an integral nonnegative matrix, be an integral nonnegative vector. It is suggested new method for reduction of integer program $\max \{cx| Ax=b, x\ge 0,…