Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
About

About

I was born in Russia in the city called Irkutsk, located in the middle of Siberia. In 2006 I graduated from the Institute of Mathematics Economics and Informatics of Irkutsk State University with the Master Degree in Applied Mathematics. Then I had started my post-graduate study at the Institute of System Dynamics and Control Theory of Siberian Branch of the Russian Academy of Sciences, Irkutsk, where in December, 2010, I have successfully defended my PhD thesis in Operations Research. In November, 2011 I have moved to Portugal and joined the research activities at INESC Porto under the project on Kidney Exchange Programs. Currently I continue research within this application of operations research under FCT post-doc grant.

My research interests are in the field of combinatorial optimization: modelling, development the methods for solving the problems such as branch and cut and price methods, cutting plane methods, column generation. As to applications I have worked on kidney exchange problem, location problems, clustering problem, PMU placement problem.

Interest
Topics
Details

Details

002
Publications

2019

Maximizing the expected number of transplants in kidney exchange programs with branch-and-price

Authors
Alvelos, F; Klimentova, X; Viana, A;

Publication
Annals of Operations Research

Abstract
In this paper, we propose a branch-and-price approach for solving the problem of maximizing the expected number of transplants in Kidney Exchange Programs (KEPs). In these programs, the decision on which transplants will be conducted is usually made with the support of optimization models with the assumption that all operations will take place. However, after a plan of transplants is defined, a pair may leave the KEP or a more accurate compatibility evaluation exam may invalidate a transplant. To model these possible events we consider probabilities of failure of vertices and of arcs and the objective of maximizing the expected number of transplants. The proposed approach is based on the so-called cycle formulation, where decision variables are associated with cycles. Built on the concept of type of cycle a branch-and-price algorithm is conceived. One subproblem is defined for each type of cycle. We present computational results of the proposed branch-and-price algorithm and compare them with solving directly the cycle formulation (with a general purpose mixed integer programming solver—CPLEX) showing that the proposed approach is the only one suitable for larger instances. © 2017 Springer Science+Business Media, LLC

2018

Observability of power systems with optimal PMU placement

Authors
Carvalho, M; Klimentova, X; Viana, A;

Publication
Computers & Operations Research

Abstract

2018

Bi-level and Bi-objective p-Median Type Problems for Integrative Clustering: Application to Analysis of Cancer Gene-Expression and Drug-Response Data

Authors
Ushakov, AV; Klimentova, X; Vasilyev, I;

Publication
IEEE/ACM Transactions on Computational Biology and Bioinformatics

Abstract

2016

Maximising expectation of the number of transplants in kidney exchange programmes

Authors
Klimentova, X; Pedroso, JP; Viana, A;

Publication
Computers & OR

Abstract
This paper addresses the problem of maximising the expected number of transplants in kidney exchange programmes. New schemes for matching rearrangement in case of failure are presented, along with a new tree search algorithm used for the computation of optimal expected values. Extensive computational experiments demonstrate the effectiveness of the algorithm and reveal a clear superiority of a newly proposed scheme, subset-recourse, as compared to previously known approaches.

2016

Maximizing expected number of transplants in kidney exchange programs

Authors
Alvelos, F; Klimentova, X; Rais, A; Viana, A;

Publication
Electronic Notes in Discrete Mathematics

Abstract
In this paper we address the problem of maximizing the expected number of transplants in a kidney exchange program. We propose an integer programming model with an exponential number of decision variables which are associated with cycles. By introducing the concept of type of cycle, we avoid the complete cycle enumeration and develop a branch-and-price approach. © 2016 Elsevier B.V.