Abstract
When each patient of a kidney exchange program has a preference ranking over its set of compatible donors, questions naturally arise surrounding the stability of the proposed exchanges. We extend recent work on stable exchanges by introducing and underlining the relevance of a new concept of locally stable, or L-stable, exchanges. We show that locally stable exchanges in a compatibility digraph are exactly the so-called local kernels (L-kernels) of an associated blocking digraph (whereas the stable exchanges are the kernels of the blocking digraph), and we prove that finding a nonempty L-kernel in an arbitrary digraph is NP-complete. Based on these insights, we propose several integer programming formulations for computing an L-stable exchange of maximum size. We conduct numerical experiments to assess the quality of our formulations and to compare the size of maximum L-stable exchanges with the size of maximum stable exchanges. It turns out that nonempty L-stable exchanges frequently exist in digraphs which do not have any stable exchange. All the above results and observations carry over when the concept of (locally) stable exchanges is extended to the concept of (locally) strongly stable exchanges.

Abstract
In today's highly competitive fashion retail market, it is crucial to have accurate demand forecasting systems, namely for new products. Many experts have used machine learning techniques to forecast product sales. However, sales that do not happen due to lack of product availability are often ignored, resulting in censored demand and service levels that are lower than expected. Motivated by the relevance of this issue, we developed a two-stage approach to forecast the demand for new products in the fashion retail industry. In the first stage, we compared four methods of transforming historical sales into historical demand for products already commercialized. Three methods used sales-weighted averages to estimate demand on the days with stock-outs, while the fourth method employed an Expectation-Maximization (EM) algorithm to account for potential substitute products affected by stock-outs of preferred products. We then evaluated the performance of these methods and selected the most accurate one for calculating the primary demand for these historical products. In the second stage, we predicted the demand for the products of the following collection using Random Forest, Deep Neural Networks, and Support Vector Regression algorithms. In addition, we applied a model that consisted of weighting the demands previously calculated for the products of past collections that were most similar to the new products. We validated the proposed methodology using a European fashion retailer case study. The results revealed that the method using the Expectation-Maximization algorithm had the highest potential, followed by the Random Forest algorithm. We believe that this approach will lead to more assertive and better-aligned decisions in production management.

Abstract

Abstract
Purpose:To synthesizethe availableevidenceaboutthe use of HealthInformationTechnology(HIT)to supportpatientsduringhemodialysis.Methods:TheJoannaBriggsInstitute's methodologicalguidelinesfor scopingreviewsandthe PRISMA-ScRchecklistwereemployed.BibliographicsearchesacrossMEDLINE (R), CINAHL (R), PsychologyandBehavioralSciencesCollection,Scopus,MedicLatina,and Cochraneyielded932 records.Results:Eighteenstudiespublishedbetween2003and2023wereincluded.Theyexploreda rangeof HITs,includingvirtualreality,exergames,websites,and mobileapplications,all specificallydevelopedfor use duringthe intradialyticperiod.Conclusion:Thisstudyhighlightsthe HITsdevelopedfor use duringhemodialysistreatment,supportingphysicalexercise,diseasemanagement,and enhancementof self-efficacyand self-care.

Abstract
Nowadays, the world's fishing fleet uses 20% more fuel to catch the same amount offish compared to 30 years ago. Addressing this negative environmental and economic performance is crucial due to stricter emission regulations, rising fuel costs, and predicted declines in fish biomass and body sizes due to climate change. Investment in more efficient engines, larger ships and better fuel has been the main response, but this is only feasible in the long term at high infrastructure cost. An alternative is to optimize operations such as the routing of a fleet, which is an extremely complex problem due to its dynamic (time-dependent) moving target characteristics. To date, no other scientific work has approached this problem in its full complexity, i.e., as a dynamic vehicle routing problem with multiple time windows and moving targets. In this paper, two bi-objective mixed linear integer programming (MIP) models are presented, one for the static variant and another for the time-dependent variant. The bi-objective approaches allow to trade off the economic (e.g., probability of high catches) and environmental (e.g., fuel consumption) objectives. To overcome the limitations of exact solutions of the MIP models, a greedy randomized adaptive search procedure for the multi-objective problem (MO-GRASP) is proposed. The computational experiments demonstrate the good performance of the MO-GRASP algorithm with clearly different results when the importance of each objective is varied. In addition, computational experiments conducted on historical data prove the feasibility of applying the MO-GRASP algorithm in a real context and explore the benefits of joint planning (collaborative approach) compared to a non-collaborative strategy. Collaborative approaches enable the definition of better routes that may select slightly worse fishing and planting areas (2.9%), but in exchange fora significant reduction in fuel consumption (17.3%) and time at sea (10.1%) compared to non-collaborative strategies. The final experiment examines the importance of the collaborative approach when the number of available drifting fishing aggregation devices (dFADs) per vessel is reduced.

Abstract
In online three-dimensional packing problems (3D-PPs), unlike offline problems, items arrive sequentially and require immediate packing decisions without any information about the quantities and sizes of the items to come. Heuristic methods are of great importance in solving online problems to find good solutions in a reasonable amount of time. However, the literature on heuristics for online problems is sparse. As our first contribution, we developed a pool of heuristics applicable to online 3D-PPs with complementary performance on different sets of instances. Computational results showed that in terms of the number of used bins, in all problem instances, at least one of our heuristics had a better or equal performance compared to existing heuristics in the literature. The developed heuristics are also fully applicable to an intermediate class between offline and online problems, referred to in this paper as a specific type of semi-online with full look-ahead, which has several practical applications. In this class, as in offline problems, complete information about all items is known in advance (i.e., full look-ahead); however, due to time or space constraints, as in online problems, items should be packed immediately in the order of their arrival. As our second contribution, we presented an algorithm selection framework, building on developed heuristics and utilizing prior information about items in this specific class of problems. We used supervised machine learning techniques to find the relationship between the features of problem instances and the performance of heuristics and to build a prediction model. The results indicate an 88% accuracy in predicting (identifying) the most promising heuristic(s) for solving any new instance from this class of problems.