|
|
|
PROGRAM > Global schedule
Monday, May 16, 2022
| Time | Event | (+) |
| 13:00 - 20:00 | Spring School Day 1 - See Spring School menue |
Tuesday, May 17, 2022
| Time | Event | (+) |
| 13:00 - 20:00 | Spring School Day 2 - See Spring School menue |
Wednesday, May 18, 2022
| Time | Event | (+) |
| 12:50 - 13:00 | Opening Session (Zoom link Plenary Session) - Opening Session | |
| 13:00 - 14:30 | Session 1 : Scheduling (Zoom Link A) - (chairman: Fabrizio Rossi) | (+) |
| 13:00 - 13:30 | › Tool switching problems in the context of overlay printing with multiple colours - Alberto Locatelli, Department of Sciences anMethods for Engineering, University of Modena and Reggio Emilia, | |
| 13:30 - 14:00 | › Worst-Case Analysis of LPT Scheduling on Small Number of Non-Identical Processors - Vorapong Suppakitpaisarn - The University of Tokyo | |
| 14:00 - 14:30 | › Shift scheduling with autonomous agents - Fabrizio Rossi - Department of Information Engineering, Computer Science and Mathematics University of L'Aquila | |
| 13:00 - 14:30 | Session 2 : Approximation algorithms I (Zoom Link B) - (chairman: David Weckbecker) | (+) |
| 13:00 - 13:30 | › Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines - Akiyoshi Shioura - Tokyo Institute of Technology | |
| 13:30 - 14:00 | › Neighborhood persistency of the linear optimization relaxation of integer linear optimization - Kei Kimura - Kyushu University | |
| 14:00 - 14:30 | › Unified Greedy Approximability Beyond Submodular Maximization - David Weckbecker - TU Darmstadt | |
| 14:30 - 15:00 | Break (join us at Gather Town) | |
| 15:00 - 16:40 | Session 3 : Routing Problems (Zoom Link A) - (chairman: Luis Gouveia) | (+) |
| 15:00 - 15:25 | › An Integer Linear Programming approach to the Time-constrained Vehicle Routing Problem with Time-windows - Maria João Lopes, Iscte-IUL, University Institute of Lisbon & CmafCio | |
| 15:25 - 15:50 | › The Traveling Salesman Problem with positional consistency constraints - Mafalda Ponte, CMAFCIO - Faculdade de Ciências, Universidade de Lisboa | |
| 15:50 - 16:15 | › Mixed-Integer Programming Formulations and Valid Inequalities for the Electric Vehicle Routing Problem - Arghavan Sharafi, Arghavan Sharafi - Nima Moradi, Nima Moradi | |
| 16:15 - 16:40 | › The Hamiltonian p-Median Problem: Polyhedral Results and Branch-and-Cut Algorithm - Michele Barbato, Dipartimento di Informatica “Giovanni degli Antoni” - Università degli Studi di Milano | |
| 15:00 - 16:40 | Session 4 : Heuristics (Zoom Link B) - (chairman: Nelson Maculan) | (+) |
| 15:00 - 15:25 | › Generalized Relax-and-Fix heuristic - Sophie Michel, Laboratoire de Mathématiques Appliquées du Havre | |
| 15:25 - 15:50 | › The Lexicographic Minimum Gap Graph Partitioning Problem - Maurizio Bruglieri, Dipartimento di Design, Politecnico di Milano | |
| 15:50 - 16:15 | › GRASP approaches to the Weighted Safe Set Problem - Alberto Boggio Tomasaz, University of Milan | |
| 16:15 - 16:40 | › A local search heuristic for the multi-mode personnel task rescheduling problem characterized by time-resource-quality trade-offs - Tessa Borgonjon, University College Ghent | |
| 16:40 - 17:00 | Break (join us at Gather Town) | |
| 17:00 - 18:40 | Session 5 : Polyhedra and algorithms (Zoom Link A) - (chairman: Santanu Dey) | (+) |
| 17:00 - 17:25 | › New Classes of Facets for Complementarity Knapsack Problems - Haoran Zhu, University of Wisconsin Madison | |
| 17:25 - 17:50 | › The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm. - Youssouf HADHBI, Laboratoire dÍnformatique, de Modélisation et dÓptimisation des Systèmes LIMOS | |
| 17:50 - 18:15 | › Polyhedral study of the Symmetrically Weighted Matrix Knapsack problem - Alexandre Heintzmann, EDF Labs, LAAS-CNRS | |
| 18:15 - 18:40 | › Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints - José-L Figueroa, Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes | |
| 17:00 - 18:40 | Session 6 : Cutting and Packing (Zoom Link B) - (chairman: Javier Marenco) | (+) |
| 17:00 - 17:25 | › High Multiplicity Strip Packing with Three Rectangle Types - Andrew Bloch-Hansen, Western University | |
| 17:25 - 17:50 | › Improved Bounds for Stochastic Extensible Bin Packing under Distributional Assumptions - Guillaume Sagnol, Technische Universität Berlin | |
| 17:50 - 18:15 | › Open-End Bin Packing Problem with Conflicts - Ece Nur Balık - Ozyegin University, Department of Industrial Engineering | |
| 18:15 - 18:40 | › An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers - Javier Marenco, Sciences Institute, National University of General Sarmiento | |
| 18:40 - 19:00 | Break (join us at Gather Town) | |
| 19:00 - 20:00 | Invited Lecture 1 : Rekha R. Thomas (Zoom link for Plenary Sessions) |
|
Thursday, May 19, 2022
| Time | Event | (+) |
| 13:00 - 14:30 | Session 7 : Game theory and Multiobjective Optimization (Zoom Link A) - (chairman: Matthias Walter) | (+) |
| 13:00 - 13:30 | › On computing the Edgeworth-Pareto hull for certain classes of multi-objective optimization problems - Markus Sinnl, Institute of Production and Logistics Management/JKU Business School, Johannes Kepler University Linz | |
| 13:30 - 14:00 | › Exact Price of Anarchy for Weighted Congestion Games with Two Players - Matthias Walter, University of Twente | |
| 14:00 - 14:30 | › Nash balanced assignment problem - Minh Hieu NGUYEN, Laboratory of Informatics, Modelling and Optimization of the Systems (LIMOS) | |
| 13:00 - 14:30 | Session 8 : Decomposition Methods (Zoom Link B) - (chairman: Laurent Alfandari) | (+) |
| 13:00 - 13:30 | › On blocking the spread of harmful contagions in networks with integer programming - Kübra Tanınmış - Institute of Production and Logistics Management, Johannes Kepler University Linz, Austria | |
| 13:30 - 14:00 | › A fractional programming method for optimal assortment under the nested-logit model - Laurent ALFANDARI, ESSEC Business School | |
| 14:00 - 14:30 | › A particular Quadratic Transportation Problem - Davide Duma, Università degli Studi di Pavia | |
| 14:30 - 15:00 | Break (join us at Gather Town) | |
| 15:00 - 16:00 | Invited Lecture 2 : Rico Zenklusen (Zoom link for Plenary Sessions) |
|
| 16:00 - 16:30 | Break (join us at Gather Town) | |
| 16:30 - 18:10 | Session 9 : SDP (Zoom Link A) - (chairman: Santanu Dey) | (+) |
| 16:30 - 16:55 | › A new Exact-Subgraph-Based Hierarchy for Stable Set - Elisabeth Gaar, Johannes Kepler University Linz | |
| 16:55 - 17:20 | › Semidefinite approximations for bicliques and biindependent pairs - Sven Polak, Centrum Wiskunde & Informatica | |
| 17:20 - 17:45 | › Finite convergence of sum-of-squares hierarchies for the stability number of a graph - Luis Felipe Vargas, cwi | |
| 17:45 - 18:10 | › Application of the Lovász-Schrijver M+ operator to graph coloring - Federico Battista, Università di Roma “Sapienza” | |
| 16:30 - 18:00 | Session 10 : Approximation algorithms II (Zoom Link B) - (chairman: Gennaro Cordasco) | (+) |
| 16:30 - 17:00 | › Autonomous transportation using platoons: approximation and hardness results - Tiberiu-Iulian Sirbu - University of Bucharest / Faculty of mathematics and Computer Science | |
| 17:00 - 17:30 | › Pervasive Domination - gennaro cordasco - Università della Campania "L.Vanvitelli" | |
| 17:30 - 18:00 | › Beyond Symmetry: Best Submatrix Selection for the Sparse SVD - Yongchun Li - Virginia Tech | |
| 18:10 - 18:30 | Break (join us at Gather Town) | |
| 18:30 - 20:10 | Session 11 : Polyhedra and combinatoric (Zoom Link A) - (chairman: Francisco Barahona) | (+) |
| 18:30 - 18:55 | › Top-k List Aggregation: Mathematical Formulations and Polyhedral Comparisons - Sina Akbari, Arizona State University | |
| 18:55 - 19:20 | › Bounded variation in binary sequences - Maja Hügging, TU Dortmund, Fakultät für Mathematik | |
| 19:20 - 19:45 | › On Permuting some Coordinates of Polytopes - Hans Raj Tiwary, Department of Applied Mathematics, Charles University [Prague] | |
| 19:45 - 20:10 | › Few Induced Disjoint Paths for H-Free Graphs - Barnaby Martin, Durham University | |
| 18:30 - 20:10 | Session 12 : Non-linear optimization (Zoom Link B) - (chairman: Sven Mallach) | (+) |
| 18:30 - 18:55 | › Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error - Aloïs Duguet, LAAS-CNRS, Toulouse INP, Université fédérale de Toulouse | |
| 18:55 - 19:20 | › An outer-approximation algorithm for maximum-entropy sampling - Marcia Fampa, Universidade Federal do Rio de Janeiro | |
| 19:20 - 19:45 | › Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization - Prashant Palkar, Prashant Palkar | |
| 19:45 - 20:10 | › A Quadratic Simplex Algorithm for Primal Optimization over Zero-One Polytopes - Sven Mallach, University of Bonn |
Friday, May 20, 2022
| Time | Event | (+) |
| 13:00 - 14:30 | Session 13 : Graphs and Trees (Zoom Link A) - (chairman: Diego Delle Donne) | (+) |
| 13:00 - 13:30 | › On the Thinness of Trees - ERIC BRANDWEIN, Universidad de Buenos Aires [Buenos Aires] | |
| 13:30 - 14:00 | › Generating Spanning Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms - Ro-Yu Wu, Department of Industrial Management, Lunghwa University of Science and Technology | |
| 13:00 - 14:30 | Session 14 : Biology/Health applications (Zoom Link B) - (chairman: Pierre Fouilhoux) | (+) |
| 13:00 - 13:30 | › Optimal Vaccination Strategies for Multiple Dose Vaccinations - Jenny Segschneider, RWTH Aachen University | |
| 13:30 - 14:00 | › One transfer per patient suffices: Structural insights about patient-to-room assignment - Sigrid Knust, University of Osnabrück | |
| 14:00 - 14:30 | › Finding synonymous coding DNA sequences with maximum base pairing - Andrea D'Ascenzo, Università degli Studi dell'Aquila | |
| 14:30 - 15:00 | Break (join us at Gather Town) | |
| 15:00 - 16:00 | Invited Lecture 3 : Petra Mutzel (Zoom link for Plenary Sessions) |
|
| 16:00 - 16:30 | Break (join us at Gather Town) | |
| 16:30 - 18:00 | Session 15 : Theory of combinatorics (Zoom Link A) - (chairman: Daniele Catanzaro) | (+) |
| 16:30 - 16:55 | › On Minimally Non-Firm Binary Matrices - Reka Agnes Kovacs, Mathematical Institute [Oxford] | |
| 17:00 - 17:30 | › Characterizing Path-Length Matrices of Unrooted Binary Trees - Daniele Catanzaro, Daniele Catanzaro, Center of Operations Research and Econometrics (CORE) Universit ́e Catholique de Louvain | |
| 16:30 - 18:00 | Session 16 : Algorithms (Zoom Link B) - (chairman: Ridha Mahjoub) | (+) |
| 16:30 - 17:00 | › Locating Obnoxious Facilities on a Line Segment - Vishwanath Reddy Singireddy, Birla Institute of Technology and Science, Pilani, Hyderabad Campus | |
| 17:00 - 17:30 | › An Efficient Post-Synthesis of Reversible Circuits - Raphael Lima, Universidade Federal Fluminense | |
| 18:00 - 18:30 | Break (join us at Gather Town) | |
| 18:30 - 19:30 | Invited Lecture 4 : Jon Lee (Zoom link for Plenary Sessions) |
|
| 19:30 - 19:40 | Closing Session - Closing Session |
| Online user: 18 | Privacy |
|
