Abstract
Kidney exchange programs (KEPs) allow the exchange of kidneys between incompatible donor-recipient pairs. Optimization approaches can help KEPs in defining which transplants should be made among all incompatible pairs according to some objective. The most common objective is to maximize the number of transplants. In this paper, we propose an integer programming model which addresses the objective of maximizing the expected number of transplants, given that there are equal probabilities of failure associated with vertices and arcs. The model is compact, i.e. has a polynomial number of decision variables and constraints, and therefore can be solved directly by a general purpose integer programming solver (e.g. Cplex).

Abstract

Abstract

Abstract

Abstract
Considering the new paradigm in the industry, where clients request small amounts of a growing range of products, the times of crisis and the fierce competition for businesses survival, it is crucial for Organizations to be able to reduce the waste of raw materials. In the manufacturing industry, the waste of materials could be minimized with the introduction of decision support systems in the process. In this paper we propose an information system that enables the optimization of purchases and consumption of materials, promoting waste reduction and boosting profitability. © 2015 AISTI.

Abstract
Considering the new paradigm in the industry, where clients request small amounts of a growing range of products, the times of crisis and the fierce competition for businesses survival, it is crucial for Organizations to be able to reduce the waste of raw materials. In the manufacturing industry, the waste of materials could be minimized with the introduction of decision support systems in the process. In this paper we propose an information system that enables the optimization of purchases and consumption of materials, promoting waste reduction and boosting profitability.