30732 research outputs found
Sort by
Algorithmic Complexity of EEG for Prognosis of Neurodegenerationin Idiopathic Rapid Eye Movement Behavior Disorder (RBD)
No full text
Reduction of Pressure Gradient and Turbulence Using Vortex Generatorsin Prosthetic Heart Valves
No full textSelective Enzymatic Digestion of Proteoglycans and Collagens AltersCartilage T1rho and T2 Relaxation Times
No full textLinking Physiological Biomarkers of Ventilator-Induced Lung Injuryto a Rich-Get-Richer Mechanism of Injury Progression
No full textMesh Convergence Behavior and the Effect of Element Integrationof a Human Head Injury Model
No full textFormulation and solution of a two-stage capacitated facility location problem with multilevel capacities
No full textImproving the performance of evolutionary algorithms: a new approach utilizing information from the evolutionary process and its application to the fuzzy portfolio optimization problem
No full textMaximizing the expected number of transplants in kidney exchange programs with branch-and-price
No full textAbstract 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 de?ned, 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 de?ned for each type of cycle. We present computational results of the proposed branch-and-price algorithm andcomparethemwithsolvingdirectlythecycleformulation(withageneralpurposemixe