Mini-Symposium on Numerical Optimization
The Numerical Analysis and Scientific Computing and Optimization and Approximation Research Groups are inviting everyone to an online Mini-Symposium on Numerical Optimization to be held on Monday, January 15, 2024, 2:00 – 4:00 PM via Zoom.
Here are the speakers:
Dr. Franklin Djeumou Fomeni (University of Quebec in Montreal)
Title: Bound, Cut, Reduce, and Branch-and-Bound on the Quadratic Knapsack Problem
Abstract: The Quadratic Knapsack Problem (QKP) is a well-known combinatorial optimization problem which has many applications in finance, logistics, telecommunications, facility location problems, etc. The QKP is NP-hard in the strong sense and the existing state-of-the-art algorithms can only handle problems of small and moderate sizes. In this presentation, we will first give a broad review of the existing solution methods. Then, we will present some recent contributions in the development of solution methods for large scale QKPs. And finally, We will present some potential venues for developing even more efficient algorithms for the QKP and other related problems.
Dr. Youssef Boulaksil (United Arab Emirates University)
Title: Nanostores’ supply chains in emerging markets – research challenges
Abstract: Nanostores are small, independent small retail stores. Collectively, they constitute the world’s largest retail channel, with over 50 million stores globally. Nanostores are known for their simple set-up, featuring a small assortment evidenced by the lower number of SKUs and category depth compared to supermarkets. They also often offer informal loan to their customers. In this presentation, I will provide an overview of various challenges encountered in nanostore supply chains. These challenges can serve as an inspiration for researchers, particularly those in the field of mathematics, to develop interesting and relevant research questions.
Dr. Edoardo Fadda (Politecnico di Torino)
Title: Network Optimization & Stochastic Optimization
Abstract: In the ever-evolving landscape of interconnected systems, the intersection of network problems and stochastic optimization has become a focal point for addressing the challenges posed by dynamic and unpredictable environments. This talk delves into the intricate relationship between network problems and stochastic optimization, exploring how the synergy between these two domains. On the one hand, we will see some classical network problems and we will understand how to deal with them as well as a set of possible applications. Then, we will see the foundation of stochastic optimization and we will see how this paradigm can be applied to networks problem.