?
FPT Algorithms for the Shortest Lattice Vector and Integer Linear Programming Problems
P. 19–35.
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 in the problems’ formulations are near square. The main parameter is the maximal absolute value of rank minors of matrices included in the problem formulation. Additionally, we present FPT algorithms with respect to the same main parameter for the problems, when the matrices have no singular rank sub-matrices.
In book
Valery A. Kalyagin, Panos M. Pardalos, Oleg Prokopyev, Irina Utkina Vol. 247. , Springer, 2018.
Springer, 2025.
This book celebrates the remarkable contributions of Panos M. Pardalos, offering a comprehensive collection of 20 rigorously peer-reviewed articles that span the breadth of his research interests. From deterministic and stochastic global optimization to combinatorial optimization, this volume provides insights into solving modern applied problems in planning theory, support vector machines, data mining, supply chain ...
Added: April 29, 2025
Omrani H., Oveysi Z., Emrouznejad A. et al., Journal of the Operational Research Society 2023 Vol. 74 No. 4 P. 1150–1165
Conventional DEA performs like a “black box” and provides no information about sub-processes. In some cases, such as banks, providing services is made up of interactive and interdependent processes. Also, in real world applications, inputs could be shared among these sub-processes. Moreover, due to the characteristics of some variables, such as number of employees, only integer values could be assigned to ...
Added: September 3, 2022
Gribanov D., Zolotykh N., Optimization Letters 2022 Vol. 16 No. 7 P. 1991–2018
Let a polyhedron $P$ be defined by one of the following ways:
\begin{enumerate}
\item[(i)] $P = \{x \in \RR^n \colon A x \leq b\}$, where $A \in \ZZ^{(n+k) \times n}$, $b \in \ZZ^{(n+k)}$ and $\rank A = n$,
\item[(ii)] $P = \{x \in \RR_+^n \colon A x = b\}$, where $A \in \ZZ^{k \times n}$, $b \in \ZZ^{k}$ ...
Added: October 29, 2021
Gribanov D., , in: Mathematical Optimization Theory and Operations Research: 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021, Proceedings.: Cham: Springer, 2021. P. 79–95.
Added: October 29, 2021
Aldunin D. A., Fedin G., Информационные технологии 2019 Т. 25 № 4 С. 250–256
Distant learning has weaknesses related to missing tutor and kind of autodidacticism of the process, which may cause learner’s frustration in uncertain situations and force him or her to drop the learning course. Inasmuch as it is very important to help learner to select a set of needed courses, the article deals with the task ...
Added: September 18, 2019
Veselov S. I., Gribanov D., Malyshev D., Moscow University Computational Mathematics and Cybernetics 2019 Vol. 43 No. 1 P. 1–11
The problem of computing the width of simplices generated by the convex hull of their integer vertices is considered. An FPT algorithm, in which the parameter is the maximum absolute value of the rank minors of the matrix consisting from the simplex vertices, is presented. ...
Added: April 22, 2019
Malyshev D., Gribanov D., Discrete Optimization 2018 Vol. 29 P. 103–110
We consider boolean linear programming formulations of the vertex and edge dominating set problems and prove their polynomial-time solvability for classes of graphs with constraint matrices having bounded minors in the absolute value. ...
Added: April 8, 2018
D. V. Gribanov, D.S. Malyshev, P. M. Pardalos et al., Journal of Combinatorial Optimization 2018 Vol. 35 No. 4 P. 1128–1146
In this paper, we present fixed-parameter tractable algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems’ formulations are near square. The parameter is the maximum absolute value of the rank minors in the corresponding matrices. Additionally, we present fixed-parameter tractable algorithms ...
Added: February 19, 2018
Gribanov D., Malyshev D., Discrete Applied Mathematics 2017 Vol. 227 P. 13–20
We consider boolean linear programming formulations of the independent set, the vertex and the edge dominating set problems and prove their polynomial-time solvability for classes of graphs with (augmented) constraint matrices having bounded minors in the absolute value ...
Added: April 23, 2017
Gribanov D., Malyshev D., Журнал Средневолжского математического общества 2016 Т. 18 № 3 С. 19–31
Мы рассматриваем естественные постановки задач о независимом множестве, о вершинном и о реберном доминирующем множестве как задач целочисленного линейного программирования и доказываем полиномиальную разрешимость этих задач для классов графов, имеющих ограниченные по абсолютному значению миноры (расширенных) матриц ограничений. ...
Added: October 20, 2016
Belenky A., Egorova L., , in: Optimization and Its Applications in Control and Data Sciences: In Honor of Boris T. Polyak’s 80th Birthday (Springer Optimization and Its Applications)Book 115.: Springer, 2016. P. 51–117.
The paper proposes two new approaches to designing efficient mathematical tools for quantitatively analyzing decision-making processes that small and medium price-taking traders undergo in forming and managing their portfolios of financial instruments traded in a stock exchange. Two mathematical models underlying these approaches are considered. If the trader can treat price changes for each financial ...
Added: October 10, 2016
Gribanov D., Chirkov A. Y., Optimization Letters 2016 Vol. 10 No. 6 P. 1179–1189
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 bounded. Additionally, we present some quasi-polynomial-time and polynomial-time algorithms to solve the integer linear optimization problem defined on simplices minus all their integer vertices ...
Added: September 12, 2016
Bronnikov S., Lazarev A. A., Petrov A. S. et al., , in: VI International Conference on Optimization Methods and Applications "Optimization and applications" (OPTIMA-2015), Petrovac, Montenegro, September 2015.: M.: -, 2015. P. 196–197.
We consider the problem of planning the ISS cosmonaut training with different objectives. A pre-defined set of minimum qualification levels should be distributed between the crew members with minimum training time differences, training expenses or a maximum of the training level with a limitation of the budget. First, a description of the cosmonaut training process ...
Added: October 20, 2015