The Speakers

Antonio Alonso Ayuso 🇪🇸: Stochastic Programming and Risk Analysis

Ph.D. in Mathematics (UCM'97). Since 2016, Professor in Statistics and Operational Research. His research is focused on Mathematical Optimization as a basic discipline for modeling and solving problems in logistics and industrial engineering. In his more than 25 years of research experience, the following contributions can be highlighted. 1) BFC: Branch and Fix Coordination: general scheme for the resolution of Stochastic Optimization problems. 2) Air traffic flow management and conflict detection and resolution. 3) Risk management, with contributions to the measurement and management of risk in industrial planning problems in multi-stage problems.

He has participated in several research projects and in research contracts with companies and training activities in companies. He has more than 45 articles published in JCR journals, most of them in Q1 journals and several chapters in books edited by Springer, Wiley, and Mathematical Programming Society. Some of the articles have several hundred citations. He has more than two hundred presentations at international conferences and has given lectures at the Universities of Edinburgh, Chile, Humboldt, Seville, and the Polytechnic University of Barcelona, among others. He has actively participated in the organization of high-level scientific events and conferences. President of ALIO (Ibero-Latinoamerican Association of Operations Research) from January 2022.

Summary: This tutorial will introduce stochastic optimisation as a tool for optimal planning. Based on several examples, different approaches are introduced (as chance constraints, robust optimization, etc), to focus on Stochastic Optimisation via scenario analysis. As opposed to the traditional deterministic models, (in which all parameters are assumed to be known in advance), this approach represents the uncertainty in the problem by means of a representative (two- or multi-stage) scenario tree. We will analyse what kind of solutions are obtained and how to take advantage of the structure of the formulation to apply efficient decomposition methods (Langrange, Benders, etc.). In the last part of the presentation, we will deal with risk management and how to introduce risk aversion measures that allow us to obtain acceptable solutions for worst-case scenarios.


Róger Ríos Mercado 🇲🇽: Optimal and Stable Matchings for Better Health Care

Roger Ríos is a Professor of Operations Research in the Graduate Program in Systems Engineering at Universidad Autonoma de Nuevo Leon, Mexico. He holds a PhD in Operations Research from the University of Texas at Austin. He has held Visiting Scholar positions at the University of Texas at Austin (OR/IE Program), Barcelona Tech (Department of Statistics and Operations Research), University of Colorado (Leeds School of Business), and University of Houston (High Performance Computing Center). His research interests are mainly in designing and developing efficient solution methods to hard discrete optimization problems. He has addressed applied decision-making problems on districting, location, health care, natural gas transportation systems, and scheduling. His research has been published in leading journals in the field. He is an Editor for Computers & Operations Research and a member of the Editorial Board of Operations Research Perspectives. More about his work can be found at http://yalma.fime.uanl.mx/~roger/.

Summary: Matching problems are an important class of discrete optimization problems involving assignment decisions among vertices in an underlying graph. Important applications in traditional areas such as transportation, routing, and scheduling, to name a few, rely on adequate modeling and efficient solution approaches to matching problems. More recently, areas such as health care management have also found a significant and important outlet among matching applications.

In this short course, a particular class of matching problems that have a direct and significant impact on health care management applications will be covered. In the first part of the course, stable matching problems and their impact on medical resident assignment will be discussed. This will cover the definition and fundamentals of the stable matching problem, the Gale-Shapley solution algorithm, and its application in a real-world large scale application such as the US National Resident Matching Program. In the second part of the course, kidney exchange problems and their influence in developing successful kidney paired donation programs will be discussed. After defining the basics and fundamentals of the kidney exchange problem, several models, solution algorithms, and their impact in significantly reducing waiting times for renal-disease patients will be highlighted.


Roberto Wolfler Calvo 🇫🇷: The Influence Maximization Problem

I received my degree at "Politecnico di Milano" where I did also my Ph.D. Then I did the post-doc at the Joint Research Centre (JRC) of the European Commission located in Ispra (Italie). I spent one year more in Ispra as a temporal agent of the European Commission. In 2001 I joined the LOSI team at the University of Troyes as Maître de conférences and at the same time, I was lecturer at Politecnico di Milano, INDACO Departement. In September 2008 I joined LIPN as a full professor of Operations Research. I animate the AOC team and I created and I animate GREFELOT (Groupe de REcherche Francilien sur l'Environement, la Logistique et le Transport). My main research interests are Combinatorial Optimisation, Mixed Integer Programming, Reformulation and Decomposition Methods, Vehicle Routing and Scheduling Problems, Design and Analysis of Combinatorial Algorithms, Metaheuristics, Reoptimization, Environmental Decision Support Systems. I'm interested in both Academic research as well Industrial applications.


Summary: Social networks are an integral part of social analysis because they play an important role in the spread of, e.g., information, innovation, or purchase decisions. A social network is defined as a graph with actors (or groups of actors) corresponding to nodes, and arcs corresponding to interactions between actors. Interactions may represent different concepts such as friendship, mentor-apprentice, one- or two-way communication, and so on. Recent years have witnessed a growing interest in the definition and study of mathematical models to represent the propagation of influence – broadly defined – in a social network, as well as in the identification of the actors that can play an important role in facilitating such propagation. Surprisingly this model fits perfectly also to model the spread of the COVID virus over a population.

The influence maximization problem is defined on a graph with an associated diffusion process that models the spread of influence on the graph. A node is defined as activated if it is affected by the diffusion process. A subset of the nodes are selected as seeds, and their role is to initialize the diffusion process. Influence propagates in a breadth-first manner starting from the seeds. Several rules can be used to model the activation of a node. An exact algorithm for the deterministic and robust IMP assuming a linear threshold model is presented in this talk. The proposed algorithm is based on a mixed-integer linear program (MILP) and Branch-and-Cut.

Elena Valentina Gutiérrez 🇨🇴: Home Health Care Logistics: Operations Research Applications

Elena Valentina Gutiérrez holds a PhD in Industrial Engineering (Universidad del Valle,2014). From 2005 to 2021 she was Full Professor at the Industrial Engineering Department in Universidad de Antioquia, and from August 2021, she is AssistantProfessor at the School of Industrial Engineering in Universidad del Valle. Elena Valentina has developed her research in the application of Operations Research and Management Sciences for modeling and solving problems in logistics and industrial engineering. She has participated in several research projects related to supply chain management and other operations research application including Warehousing, Inventory Management, Routing and Transportation, Home Health Care Logistics, Timetabling Problems, Health Care Modeling, Food Security and Hunger, and Sustainability in Urban Transportation. Elena Valentina is the current President of the Colombian Association of Operations Research (ASOCIO) and is one of the founders and coordinator of the Working Group on Healthcare for ASOCIO. Since 2022 she is also vicepresident of ALIO.

Summary: Home Health Care (HHC) services are a growing sector in national healthcare systems, especially due to the pandemic generated by the coronavirus disease (COVID-19), which increased the demand of patients receiving coordinated medical care at their homes. In this context, HHC managers face a set of logistics decisions aiming at efficiently deliver health services, while improving the use of scarce resources and patients life quality. In this talk, we first identify social and economic factors that motivate the implementation of HHC services in healthcare systems. We then characterize the maturity levels of logistics decisions in HHC services, based on a capability maturity model applied with HHC providers in two large cities in Colombia. Lastly, we illustrate the application of operations research techniques to support logistics decisions based on a real case study.


Victor Blanco 🇪🇸: A travel on location analysis and applications to machine learning

Víctor Blanco is an Associate Professor in Quantitative Methods for Economics & Business at the Universidad de Granada, Spain. He has a MSc in Pure Mathematics from the Universidad de Granada (2005) and PhD in OR from the Universidad de Sevilla (2009). His research has focused in a wide variety of topics related to Mathematical Optimization, such as Logistics & Transportation, Data Science, Computational Algebra or Algorithmic with more than 40 papers published in top OR journals, including Mathematical Programming, European Journal of Operations Research, Computers & Operations Research, Omega, Fuzzy Sets & Systems and Advances in Data Analysis and Classification. He has been interested both in the theoretical and applied aspects of Mathematical Programming. He is PI in several (local, regional, and national) research projects and has collaborated on different industrial contracts. He has carried several research stays at internationally recognized research centers like the Institute of Mathematics & its application (IMA, University of Minnesota), the University of British Columbia, the University of California-Davis and the University of Edinburgh. He is currently an active member of the Spanish Stats & OR Society (SEIO), the Spanish Network on Location Analysis and Related Problems (REDLOCA), and the Institute of Mathematics of the Universidad de Granada (IMAG).

Summary: Location Science (LS) is a very active research field in OR. The main goal of LS is to find the “optimal” position of one of more facilities in order to satisfy the requirements of a set of demand points. The nature of the facilites and the demand points, the way of measuring the goodness of the positions, the requirements for the facilities, the allocation patterns, the type of application, etc generate a wide amount of different challenging problems in this area. In this lecture I will provide an overview of different types of location problems and the different methodologies that have been developed to solve them. I will emphasize on the importance of Mathematical Optimization for solving Location problems, in particular integer linear programming and mixed integer second order cone programming. On the other hand, I will show the role of facility location in the design of novel tools in Machine Learning, concretely in the construction of classification and clustering rules, and how these optimization-based tools improve the existing methodologies.



Marta Cabo Nodar 🇲🇽: The Art of Cutting. Problems and Methods for Cutting Two-Dimensional Figures from Rectangular Plates

Matha Cabo studied a Bachelor's degree in Mathematics at the University of Santiago de Compostela, in Spain, and a Ph.D. in Operations Research at the University of Southampton in England. In 2009 she became an adjunct professor at ITAM (Mexico's Autonomous Technological Institute) and since 2011 she is a member of the Mexican National Research System (SNI - Level 1 since 2017).

Her research has focused on the design of heuristics for solving different optimization problems: routing problems, scheduling problems, or more recently cut-and-pack problems. She has dedicated a large part of her last stage as a researcher to these last problems, supported by a project of the Newton Funds, of the Royal Society (U.K.) to carry out research and establish a working group in Mexico.


Summary: In this course we will present the different versions of the cutting and packing problems, starting from the simplest and most studied to end with the new problems and challenges that arise.


We will structure the course by alternating theory with practice. In theory, we will explain the different problems found in the literature, similarities, and differences between them, as well as a review of different solution methods depending on the problem.


The practical part will combine the implementation of the previously studied models with the development of own models. Get ready to get your hands “dirty” with programming!


Hopefully, after this mini-course, interest in this type of problem will be sparked, which, like most Operations Research problems, are easy to explain, but very complex to solve.


Cipriano Santos 🇲🇽: Introduction to mathematical optimization with the Gurobi Python API

Cipriano Santos professional goal is to investigate, invent, and develop novel applications of mathematical optimization techniques to increase the operational efficiency of business processes. During his 23 years at HP Labs, he participated on several applied research projects developing mathematical optimization models and decision support tools for Supply Chain Inventory Management, Customer Relationship Management, Optimal Resource Allocation for Large Data Centers, Large Scale Workforce Planning tools for the services industry –including tactical Resource Planning, Airline Dispatcher Workload Distribution Optimization, and Operating Room Planning and Scheduling. In January of 2018, he joined Gurobi Optimization as a Sr. Technical Content Manager. In September of 2021, Santos joined Tecnológico de Monterrey University as a Distinguished Professor of the school of Industrial Engineering. Santos has a bachelor degree in applied mathematics –Actuary with major in Operations Research, from the University of Mexico (UNAM), and a Master and PhD degrees in Operations Research from the University of Waterloo in Canada.

Summary: During this workshop we will discuss mathematical optimization (a.k.a. mathematical programming) using the Gurobi Python API. The workshop has two sessions of 2 hrs. each one. During the first session, we will provide an overview of the world of optimization and discuss mathematical optimization in the context of ‘Operations’ Artificial Intelligence. Then, we present the main components of a mathematical optimization model and discuss a simple manufacturing problem formulated as a linear programming model using the Gurobi Python API. Variations of the manufacturing problem will help us to explain various outcomes of a linear programming problem using the Gurobi Python API, such as a problem with multiple solutions, a problem that is unbounded, and a problem that is infeasible.

For the second session, we will present various ‘real’ life problems formulated as mixed integer linear programming models using the Gurobi Python API. Knowledge of Python at the beginners’ level is highly recommended. We will use Google Colab notebooks to formulate and run the mathematical optimization problems using the Gurobi Python API.

Rosiane de Freitas 🇧🇷: Combinatorial graph games, winning strategies and dynamic programming

Rosiane de Freitas is a Brazilian computer scientist, Associate Professor at the Institute of Computing of the Federal University of Amazonas, Brazil. Leader of the CNPq research group on "Optimization, algorithms and computational complexity", she coordinates projects in collaboration with research groups around the world, with an emphasis on combinatorial optimization, algorithms, game, graph and scheduling theory, and integer/constraint programming. Representative of Brazil at Latin American Center for Computer Studies - CLEI. Former Vice-President representing Latin America at the International Federation of Operational Research Societies, coordinating the Committee for Developing Countries, until 2021. R&D project leader with a large high-tech industry. Active in competitive programming, being a member of the programming contests steering committee of the Brazilian Computer Society (SBC) with ICPC, and coach of Brazilian medalist and world finalist teams. Active in HR training actions for basic education, women in STEM, and technological innovation. Rosiane writes playful texts in the form of short stories for the dissemination of computer science.

Summary: This lecture is about the theory behind games, with an emphasis on combinatorial graph games and algorithms. Have you watched “A Beautiful Mind" and WarGames? Have you tried Nash equilibrium, Von Neumman's minmax theorem, and prisoner's dilemma? Do you play strategic GO, have you heard of the chicken game or how do you always win in a game of sticks on a table with friends? Game theory involves the study of situations of cooperation, competition, or conflict, whenever two or more agents or decision-makers opt for different actions in an attempt to win, the result of each one depends on the decisions of others, in a situation of similar interdependence to a game, where the best decision is made for the system as a whole. Election, evolutionary, purchase and sale, supply and demand processes in general, are examples of potential applications. Winning strategies in variations of Nim's game in graphs, the Sprague-Grundy Function theorem will be presented, as well as algorithmic strategies with an emphasis on dynamic programming.

Juan G. Villegas 🇨🇴: Operations research applications for the circular economy

Juan G. Villegas holds a joint Ph.D. in Industrial Engineering/Systems Optimization between the Universidad de los Andes (Colombia) and the Université de Technologie de Troyes (France). He is a full professor of the Department of Industrial Engineering at Universidad de Antioquia (Medellín, Colombia).  He was the founding president of the Colombian Operational Research Society. Prof. Villegas also served as Secretary of ALIO (Asociación Latino Iberoamericana de Investigación Operativa) from 2019 to 2021. His research interests include the use of exact and metaheuristic methods for multi-objective optimization, facility location, and supply chain planning problems. Particularly, he is currently interested in the application of optimization models in the planning and performance evaluation of educational systems, agro-industrial applications, waste management, and the implementation of the circular economy.

Summary: The circular economy is an emerging concept that is gaining relevance in public policy and the academic literature. Defined as “an economic system that replaces the ‘end-of-life ’ concept with reducing, alternatively reusing, recycling and recovering materials in production/distribution and consumption processes. It operates at the micro-level (products, companies, consumers), meso-level (eco-industrial parks), and macro-level (city, region, nation, and beyond), with the aim to accomplish sustainable development, thus simultaneously creating environmental quality, economic prosperity, and social equity, to the benefit of current and future generations. It is enabled by novel business models and responsible consumers” (Kirchherr et al. 2017). The implementation of the circular economy concept within the operations of firms and supply chains encompasses several challenges, including the redesign of the products, the management of reverse/circular flows, and the definition of new business models (Agrawal et al, 2018).

Initially, this talk introduces the circular economy concept and some of the most salient strategies within it (e.g. industrial symbiosis, product-as-a-service, extended producer responsibility, etc.). Then, we review how different operations research tools can be applied to face these challenges by supporting the decision-making process in organizations, supply chains, and industries adopting the circular economy principle. Finally, we illustrate the application of operations research techniques to support decisions on the implementation of circular economy concepts on case studies arising in the Colombian context.

*joint work with Pablo A. Maya (Department of Industrial Engineering- Universidad de Antioquia-Colombia)


Thaylon Nogueira 🇧🇷: Optimization with FICO

Based in Sao Paulo, Brazil, Thaylon works as a global solution consultant for the FICO's Xpress Optimization Suite. Responsible for managing Optimization opportunities for the entire Latin America and Caribbean (LAC) and NORAM regions, with active participation in several others in the EMEA territory. Speaker in several events, leads engagements ranging from C-level business meetings to technical solution assessments, with clients from all the industry spectrum: Financial Services, Health Care, Telecom, Retail, Transportation, Manufacturing and Insurance. His background is at the Optimization space, whereas for several years he had worked for major consulting companies in Brazil, delivering Optimization projects in several companies using different technologies and platforms in different areas of business.

Summary: Why companies such as Amazon, Nestle, Shell, American Airlines, Bank of America, are looking at Optimization to solve their most complex problems to increase profitability and achieve true operational cost reduction? Through several case studies, use cases and demos, this presentation aims to show the applicability of Optimization, from Financial Services to Supply Chain, and to learn how the world's largest companies are benefiting from FICO technology to enable data-driven decision making based on Optimization.