| Publication | Date of Publication | Type |
|---|
On properties of \(h\)-differentiable functions
Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika | 2025-01-22 | Paper |
On local invertibility of functions of an \(h\)-complex variable
Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika | 2025-01-22 | Paper |
Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
Springer Proceedings in Mathematics & Statistics | 2024-03-22 | Paper |
| Mapping using \(p\)-holomorphic functions | 2024-02-23 | Paper |
MIP heuristics for a resource constrained project scheduling problem with workload stability constraints
Mathematical Optimization Theory and Operations Research | 2023-08-21 | Paper |
Discrete facility location in machine learning
Diskretnyi analiz i issledovanie operatsii | 2022-08-29 | Paper |
Near-optimal large-scale k-medoids clustering
Information Sciences | 2021-11-30 | Paper |
| Integer programming approach to the data traffic paths recovering problem | 2021-04-19 | Paper |
| First-order discrete equations with matrix variable noncommutative coefficients | 2017-10-18 | Paper |
| First-order difference equations in the Banach algebra \(\ell_{\infty,\lambda}\) | 2017-10-04 | Paper |
| scientific article; zbMATH DE number 6745074 (Why is no real title available?) | 2017-07-14 | Paper |
A branch and cut heuristic for a runway scheduling problem
Automation and Remote Control | 2017-02-17 | Paper |
Lifted and local reachability cuts for the vehicle routing problem with time windows
Computers & Operations Research | 2016-11-10 | Paper |
An implementation of exact knapsack separation
Journal of Global Optimization | 2016-10-26 | Paper |
Computational testing of a separation procedure for the knapsack set with a single continuous variable
INFORMS Journal on Computing | 2016-06-29 | Paper |
The dispatching problem on multitrack territories: heuristic approaches based on mixed integer linear programming
Networks | 2016-06-10 | Paper |
Threshold robustness in discrete facility location problems: a bi-objective approach
Optimization Letters | 2015-10-06 | Paper |
A cutting plane method for knapsack polytope
Journal of Computer and Systems Sciences International | 2013-08-05 | Paper |
On an approach to the robustness in the case of the \(p\)-median problem
The Bulletin of Irkutsk State University. Series Mathematics | 2013-06-12 | Paper |
Polyhedral study of simple plant location problem with order
Operations Research Letters | 2013-05-14 | Paper |
An aggregation heuristic for large scale p-median problem
Computers & Operations Research | 2012-11-15 | Paper |
A computational study of a nonlinear minsum facility location problem
Computers & Operations Research | 2012-11-15 | Paper |
Lagrangian relaxations for the nonlinear \(p\)-median problem
The Bulletin of Irkutsk State University. Series Mathematics | 2012-09-05 | Paper |
| The decomposition method for the \(p\)-median problem on a disconnected graph | 2012-02-10 | Paper |
| The branch and cut method for the facility location problem with client's preferences | 2012-02-10 | Paper |
| On a condition for the representability of entire functions of finite degree by Fourier integrals of functions from \(L_ p\) | 2010-10-14 | Paper |
A computational study of exact knapsack separation for the generalized assignment problem
Computational Optimization and Applications | 2010-04-28 | Paper |
New lower bounds for the facility location problem with clients' preferences
Computational Mathematics and Mathematical Physics | 2009-12-17 | Paper |
An effective heuristic for large-scale capacitated facility location problems
Journal of Heuristics | 2009-12-11 | Paper |
Computational experience with general cutting planes for the set covering problem
Operations Research Letters | 2009-02-23 | Paper |
A computational study of local search algorithms for Italian high-school timetabling
Journal of Heuristics | 2008-06-23 | Paper |
A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
JMMA. Journal of Mathematical Modelling and Algorithms | 2008-04-11 | Paper |
A computational study of a cutting plane algorithm for university course timetabling
Journal of Scheduling | 2007-05-15 | Paper |
Computational study of large-scale \(p\)-median problems
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
A branch-and-cut algorithm for the median-path problem
Computational Optimization and Applications | 2006-05-02 | Paper |
| scientific article; zbMATH DE number 2230234 (Why is no real title available?) | 2005-11-18 | Paper |
A decomposition approach for a very large scale optimal diversity management problem
4OR | 2005-08-25 | Paper |
Using real space pseudopotentials for the electronic structure problem
Handbook of Numerical Analysis | 2005-04-05 | Paper |
| scientific article; zbMATH DE number 2107046 (Why is no real title available?) | 2004-10-11 | Paper |
| scientific article; zbMATH DE number 1521318 (Why is no real title available?) | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1058960 (Why is no real title available?) | 1998-09-28 | Paper |
| scientific article; zbMATH DE number 4194396 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4011173 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3879501 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3757075 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3778077 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3707109 (Why is no real title available?) | 1981-01-01 | Paper |
