Abstract
Kidney exchange programs have been set in several countries within national, regional or hospital frameworks, to increase the possibility of kidney patients being transplanted. For the case of hospital programs, it has been claimed that hospitals would benefit if they collaborated with each other, sharing their internal pools and allowing transplants involving patients of different hospitals. This claim led to the study of multi-hospital exchange markets. We propose a novel direction in this setting by modeling the exchange market as an integer programming game. The analysis of the strategic behavior of the entities participating in the kidney exchange game allowed us to prove that the most rational game outcome maximizes the social welfare and that it can be computed in polynomial time.

Abstract
One of the challenges in a kidney exchange program (KEP) is to choose policies that ensure an effective and fair management of all participating patients. In order to understand the implications of different policies of patient allocation and pool management, decision makers should be supported by a simulation tool capable of tackling realistic exchange pools and modeling their dynamic behavior. In this paper, we propose a KEP simulator that takes into consideration the wide typology of actors found in practice (incompatible pairs, altruistic donors, and compatible pairs) and handles different matching policies. Additionally, it includes the possibility of evaluating the impact of positive crossmatch of a selected transplant, and of dropouts, in a dynamic environment. Results are compared to those obtained with a complete information model, with knowledge of future events, which provides an upper bound to the objective values. Final results show that shorter time intervals between matches lead to higher number of effective transplants and to shorter waiting times for patients. Furthermore, the inclusion of compatible pairs is essential to match pairs of specific patient-donor blood type. In particular, O-blood type patients benefit greatly from this inclusion.

Abstract
The uncapacitated facility location problem (UFLP) is a popular combinatorial optimization problem with practical applications in different areas, from logistics to telecommunication networks. While most of the existing work in the literature focuses on minimizing total cost for the deterministic version of the problem, some degree of uncertainty (e.g., in the customers' demands or in the service costs) should be expected in real-life applications. Accordingly, this paper proposes a simheuristic algorithm for solving the stochastic UFLP (SUFLP), where optimization goals other than the minimum expected cost can be considered. The development of this simheuristic is structured in three stages: (i) first, an extremely fast savings-based heuristic is introduced; (ii) next, the heuristic is integrated into a metaheuristic framework, and the resulting algorithm is tested against the optimal values for the UFLP; and (iii) finally, the algorithm is extended by integrating it with simulation techniques, and the resulting simheuristic is employed to solve the SUFLP. Some numerical experiments contribute to illustrate the potential uses of each of these solving methods, depending on the version of the problem (deterministic or stochastic) as well as on whether or not a real-time solution is required.

Abstract
Many studies regarding environmental concerns in forest harvest scheduling problems deal with constraints on the maximum clearcut size. However, these constraints tend to disperse harvests across the forest and thus to generate a more fragmented landscape. When a forest is fragmented, the amount of edge increases at the expense of the core area. Highly fragmented forests can neither provide the food, cover, nor the reproduction needs of core-dependent species. This study presents a branch-and-bound procedure designed to find good feasible solutions, in a reasonable time, for forest harvest scheduling problems with constraints on maximum clearcut size and minimum core habitat area. The core area is measured by applying the concept of subregions. In each branch of the branch-and-bound tree, a partial solution leads to two children nodes, corresponding to the cases of harvesting or not a given stand in a given period. Pruning is based on constraint violations or unreachable objective values. The approach was tested with forests ranging from some dozens to more than a thousand stands. In general, branch-and-bound was able to quickly find optimal or good solutions, even for medium/large instances.

Abstract

Abstract
As technology innovation rapidly changes service experiences, service designers need to leverage technology and orchestrate complex service systems to create innovative services while enabling seamless customer experiences. Service design builds upon contributions from multiple fields, including management, information technology, and interaction design. Still, more integration to leverage the role of technology for service innovation is needed. This article integrates these two service design perspectives, management and interaction design, into an interdisciplinary methodthe Management and INteraction Design for Service (MINDS). Using a design science research approach, MINDS synthesizes management perspective models, which focus on creating new value propositions and orchestrating multiple service interfaces, with interaction design perspective models, which focus on technology usage and its surrounding context. This article presents applications of the MINDS method in two different service industries (media and health care) to demonstrate how MINDS enables creating innovative technology-enabled services and advances interdisciplinary service research.