Xenia Klimentova

Orcid: 0000-0003-1085-0810

Affiliations:
  • INESC TEC, Porto, Portugal


According to our database1, Xenia Klimentova authored at least 18 papers between 2013 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Novel integer programming models for the stable kidney exchange problem.
Eur. J. Oper. Res., June, 2023

2022
The Probabilistic Travelling Salesman Problem with Crowdsourcing.
Comput. Oper. Res., 2022

2021
Robust Models for the Kidney Exchange Problem.
INFORMS J. Comput., 2021

Data and optimisation requirements for Kidney Exchange Programs.
Health Informatics J., 2021

Modelling and optimisation in European Kidney Exchange Programmes.
Eur. J. Oper. Res., 2021

Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange.
CoRR, 2021

A comparison of matching algorithms for kidney exchange programs addressing waiting time.
Central Eur. J. Oper. Res., 2021

A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
Compensation Scheme With Shapley Value For Multi-Country Kidney Exchange Programmes.
Proceedings of the 34th International ECMS Conference on Modelling and Simulation, 2020

2019
Maximizing the expected number of transplants in kidney exchange programs with branch-and-price.
Ann. Oper. Res., 2019

2018
Bi-level and Bi-objective p-Median Type Problems for Integrative Clustering: Application to Analysis of Cancer Gene-Expression and Drug-Response Data.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Observability of power systems with optimal PMU placement.
Comput. Oper. Res., 2018

2016
Maximizing expected number of transplants in kidney exchange programs.
Electron. Notes Discret. Math., 2016

Maximising expectation of the number of transplants in kidney exchange programmes.
Comput. Oper. Res., 2016

The <i>p</i>-median Problem with Order for Two-Source Clustering.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

2014
A New Branch-and-Price Approach for the Kidney Exchange Problem.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

2013
Polyhedral study of simple plant location problem with order.
Oper. Res. Lett., 2013

New insights on integer-programming models for the kidney exchange problem.
Eur. J. Oper. Res., 2013


  Loading...