Abstract
Tactical Sales and Operations Planning (S&OP) has emerged as an extension of the aggregate production planning, integrating mid-term decisions from procurement, production, distribution, and sales in a single plan. Despite the growing interest in the subject, past synthesizing research has focused more on the qualitative and procedural aspects of the topic rather than on modeling approaches to the problem. This paper conducts a review of the existing decision-making, i.e., optimization, models supporting S&OP. A holistic framework comprising the decisions involved in this planning activity is presented. The reviewed literature is arranged within the framework and grouped around different streams of literature which have been extending the aggregate production planning. Afterwards, the papers are classified according to the modeling approaches employed by past researchers. Finally, based on the characterization of the level of integration of different business functions provided by existing models, the review demonstrates that there are no synthesizing models characterizing the overall S&OP problem and that, even in the more comprehensive approaches, there is potential to include additional decisions that would be the basis for more sophisticated and proactive S&OP programs. We do expect this paper contributes to set the ground for more oriented and structured research in the field.

Abstract
Irregular packing problems (also known as nesting problems) belong to the more general class of cutting and packing problems and consist of allocating a set of irregular and regular pieces to larger rectangular or irregular containers, while minimizing the waste of material or space. These problems combine the combinatorial hardness of cutting and packing problems with the computational difficulty of enforcing the geometric non-overlap and containment constraints. Unsurprisingly, nesting problems have been addressed, both in the scientific literature and in real-world applications, by means of heuristic and metaheuristic techniques. However, more recently a variety of mathematical models has been proposed for nesting problems. These models can be used either to provide optimal solutions for nesting problems or as the basis of heuristic approaches based on them (e.g. matheuristics). In both cases, better solutions are sought, with the natural economic and environmental positive impact. Different modeling options are proposed in the literature. We review these mathematical models under a common notation framework, allowing differences and similarities among them to be highlighted. Some insights on weaknesses and strengths are also provided. By building this structured review of mathematical models for nesting problems, research opportunities in the field are proposed.

Abstract
The retail shelf space planning problem has long been addressed by Marketing and Operations Research (OR) professionals and researchers, with the first empirical studies tracing back to the 1960s and the first modelling approaches back to the 1970s. Due to this long history, this field presents a wide range of different mathematical modelling approaches that deal with the decisions surrounding a set of products and not only define their space assignment and related quantity, but also their vertical and horizontal positioning within a retail shelf. These decisions affect customer demand, namely in the form of space- and position-dependent demand and replenishment requirements. Current literature provides either more comprehensive decision models with a wide range of demand effects but limited practical applicability, or more simplistic model formulations with greater practical application but limited consideration of the associated demand. Despite the recent progress seen in this research area, no work has yet systematised published research with a clear focus on shelf space planning. As a result, there is neither any up-to-date structured literature nor a unique model approach, and no benchmark sets are available. This paper provides a description and a state-of-the-art literature review of this problem, focusing on optimisation models. Based on this review, a classification framework is proposed to systematise the research into a set of sub-problems, followed by a unified approach with a univocal notation of model classes. Future lines of research point to the most promising open questions in this field.

Abstract
Designing a viable carsharing system in a competitive environment is challenging and often dependent on a myriad of decisions. This paper establishes and presents an integrated conceptual decision-support framework for carsharing systems, encompassing critical decisions that should be made by carsharing organizations and users. To identify the main decisions in a carsharing system, and the inputs and interactions among them, it is crucial to obtain a comprehensive understanding of the current state of the literature as well as the business practices and context. To this aim, a holistic and in-depth literature review is conducted to structure distinct streams of literature and their main findings. Then, we describe some of the key decisions and business practices that are often oversimplified in the literature. Finally, we propose a conceptual decision-support framework that systematizes the interactions between the usually isolated problems in the academic literature and business practices, integrating the perspectives of carsharing organizations and of their users. From the proposed framework, we identify relevant research gaps and ways to bridge them in the future, toward more realistic and applicable research.

Abstract
The carsharing market has never been as competitive as it is now, and during the last years, we have been witnessing a boom in the number of carsharing organizations that appear, often accompanied by an also booming number of companies that disappear. Designing a viable carsharing system is challenging and often depends on local conditions as well as on a myriad of operational decisions that need to be supported by suitable decision support systems. Therefore, carsharing is being increasingly studied in the Operations Management (OM) literature. Nevertheless, often due to the limited transparency of this highly competitive sector and the recency of this business, there is still a "gap of understanding" of the scientific community concerning the business practices and contexts, often resulting in over-simplifications and relevant problems being overlooked. In this paper, we aim to close this "gap of understanding" by describing, conceptualizing, and analyzing the reality of 34 business to-consumer carsharing organizations. With the data collected, we propose a detailed description of the current business practices, such as the ones concerning pricing. From this, we highlight relevant "research insights" and structure all collected data organized by different OM topics, enabling knowledge to be further developed in this field.

Abstract
Tackling uncertainty is becoming increasingly relevant for decision-support across fields due to its critical impact on real-world problems. Uncertainty is often modelled using scenarios, which are combinations of possible outcomes of the uncertain parameters in a problem. Alongside expected value methods, decisions under uncertainty may also be tackled using methods that do not rely on probability distributions and model different decision-maker risk profiles. Scenarios are at the core of these approaches. Therefore, we propose a scenario generation methodology that seizes the structure and concepts of genetic algorithms. This methodology aims to obtain a diverse set of scenarios, evolving a scenario population with a diversity goal. Diversity is here expressed as the difference in the impact that scenarios have on the value of potential solutions to the problem. Moreover, this method does not require a priori knowledge of probability distributions or statistical moments of uncertain parameters, as it is based on their range. We adapt the available code for Biased-Random Key Genetic Algorithms to apply the methodology to a packing problem under demand uncertainty as a proof of concept, also extending its use to a multiobjective setting. We make available these code adaptations to allow the straightforward application of this scenario generation method to other problems. With this, the decision-maker obtains scenarios with a distinct impact on potential solutions, enabling the use of different criteria based on their profile and preferences.