PROGRAM > Global schedule

Week List

	Mon. 16	Tue. 17	Wed. 18	Thu. 19	Fri. 20
12:00 13:00 14:00 15:00 16:00 17:00 18:00 19:00 20:00	Spring School Day 1 13:00 - 20:00 (7h) Spring School Day 1	Spring School Day 2 13:00 - 20:00 (7h) Spring School Day 2	Opening Session (Zoom link Plenary Session) 12:50 - 13:00 (10min) Opening Session (Zoom link Plenary Session) Opening Session Session 1 : Scheduling Session 2 : Approximation algorithms I 13:00 - 14:30 (1h30) Session 1 : Scheduling Zoom Link A (chairman: Fabrizio Rossi) › 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:00-13:30 (30min) › Worst-Case Analysis of LPT Scheduling on Small Number of Non-Identical Processors - 13:30-14:00 (30min) › Shift scheduling with autonomous agents - 14:00-14:30 (30min) 13:00 - 14:30 (1h30) Session 2 : Approximation algorithms I Zoom Link B (chairman: David Weckbecker) › Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines - 13:00-13:30 (30min) › Neighborhood persistency of the linear optimization relaxation of integer linear optimization - 13:30-14:00 (30min) › Unified Greedy Approximability Beyond Submodular Maximization - 14:00-14:30 (30min) Break (join us at Gather Town) 14:30 - 15:00 (30min) Break (join us at Gather Town) Session 3 : Routing Problems Session 4 : Heuristics 15:00 - 16:40 (1h40) Session 3 : Routing Problems Zoom Link A (chairman: Luis Gouveia) › 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:00-15:25 (25min) › The Traveling Salesman Problem with positional consistency constraints - Mafalda Ponte, CMAFCIO - Faculdade de Ciências, Universidade de Lisboa 15:25-15:50 (25min) › Mixed-Integer Programming Formulations and Valid Inequalities for the Electric Vehicle Routing Problem - Arghavan Sharafi, Arghavan Sharafi - Nima Moradi, Nima Moradi 15:50-16:15 (25min) › 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 16:15-16:40 (25min) 15:00 - 16:40 (1h40) Session 4 : Heuristics Zoom Link B (chairman: Nelson Maculan) › Generalized Relax-and-Fix heuristic - Sophie Michel, Laboratoire de Mathématiques Appliquées du Havre 15:00-15:25 (25min) › The Lexicographic Minimum Gap Graph Partitioning Problem - Maurizio Bruglieri, Dipartimento di Design, Politecnico di Milano 15:25-15:50 (25min) › GRASP approaches to the Weighted Safe Set Problem - Alberto Boggio Tomasaz, University of Milan 15:50-16:15 (25min) › 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:15-16:40 (25min) Break (join us at Gather Town) 16:40 - 17:00 (20min) Break (join us at Gather Town) Session 5 : Polyhedra and algorithms Session 6 : Cutting and Packing 17:00 - 18:40 (1h40) Session 5 : Polyhedra and algorithms Zoom Link A (chairman: Santanu Dey) › New Classes of Facets for Complementarity Knapsack Problems - Haoran Zhu, University of Wisconsin Madison 17:00-17:25 (25min) › 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:25-17:50 (25min) › Polyhedral study of the Symmetrically Weighted Matrix Knapsack problem - Alexandre Heintzmann, EDF Labs, LAAS-CNRS 17:50-18:15 (25min) › 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 18:15-18:40 (25min) 17:00 - 18:40 (1h40) Session 6 : Cutting and Packing Zoom Link B (chairman: Javier Marenco) › High Multiplicity Strip Packing with Three Rectangle Types - Andrew Bloch-Hansen, Western University 17:00-17:25 (25min) › Improved Bounds for Stochastic Extensible Bin Packing under Distributional Assumptions - Guillaume Sagnol, Technische Universität Berlin 17:25-17:50 (25min) › Open-End Bin Packing Problem with Conflicts - 17:50-18:15 (25min) › 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:15-18:40 (25min) Break (join us at Gather Town) 18:40 - 19:00 (20min) Break (join us at Gather Town) Invited Lecture 1 : Rekha R. Thomas 19:00 - 20:00 (1h) Invited Lecture 1 : Rekha R. Thomas Zoom link for Plenary Sessions https://isco2022.sciencesconf.org/data/program/Rekha.pdf	Session 7 : Game theory and Multiobjective Optimization Session 8 : Decomposition Methods 13:00 - 14:30 (1h30) Session 7 : Game theory and Multiobjective Optimization Zoom Link A (chairman: Matthias Walter) › 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:00-13:30 (30min) › Exact Price of Anarchy for Weighted Congestion Games with Two Players - Matthias Walter, University of Twente 13:30-14:00 (30min) › Nash balanced assignment problem - Minh Hieu NGUYEN, Laboratory of Informatics, Modelling and Optimization of the Systems (LIMOS) 14:00-14:30 (30min) 13:00 - 14:30 (1h30) Session 8 : Decomposition Methods Zoom Link B (chairman: Laurent Alfandari) › On blocking the spread of harmful contagions in networks with integer programming - 13:00-13:30 (30min) › A fractional programming method for optimal assortment under the nested-logit model - Laurent ALFANDARI, ESSEC Business School 13:30-14:00 (30min) › A particular Quadratic Transportation Problem - Davide Duma, Università degli Studi di Pavia 14:00-14:30 (30min) Break (join us at Gather Town) 14:30 - 15:00 (30min) Break (join us at Gather Town) Invited Lecture 2 : Rico Zenklusen 15:00 - 16:00 (1h) Invited Lecture 2 : Rico Zenklusen Zoom link for Plenary Sessions https://isco2022.sciencesconf.org/data/program/Rico.pdf Break (join us at Gather Town) 16:00 - 16:30 (30min) Break (join us at Gather Town) Session 9 : SDP Session 10 : Approximation algorithms II 16:30 - 18:10 (1h40) Session 9 : SDP Zoom Link A (chairman: Santanu Dey) › A new Exact-Subgraph-Based Hierarchy for Stable Set - Elisabeth Gaar, Johannes Kepler University Linz 16:30-16:55 (25min) › Semidefinite approximations for bicliques and biindependent pairs - Sven Polak, Centrum Wiskunde & Informatica 16:55-17:20 (25min) › Finite convergence of sum-of-squares hierarchies for the stability number of a graph - Luis Felipe Vargas, cwi 17:20-17:45 (25min) › Application of the Lovász-Schrijver M+ operator to graph coloring - Federico Battista, Università di Roma “Sapienza” 17:45-18:10 (25min) 16:30 - 18:00 (1h30) Session 10 : Approximation algorithms II Zoom Link B (chairman: Gennaro Cordasco) › Autonomous transportation using platoons: approximation and hardness results - 16:30-17:00 (30min) › Pervasive Domination - 17:00-17:30 (30min) › Beyond Symmetry: Best Submatrix Selection for the Sparse SVD - 17:30-18:00 (30min) Break (join us at Gather Town) 18:10 - 18:30 (20min) Break (join us at Gather Town) Session 11 : Polyhedra and combinatoric Session 12 : Non-linear optimization 18:30 - 20:10 (1h40) Session 11 : Polyhedra and combinatoric Zoom Link A (chairman: Francisco Barahona) › Top-k List Aggregation: Mathematical Formulations and Polyhedral Comparisons - Sina Akbari, Arizona State University 18:30-18:55 (25min) › Bounded variation in binary sequences - Maja Hügging, TU Dortmund, Fakultät für Mathematik 18:55-19:20 (25min) › On Permuting some Coordinates of Polytopes - Hans Raj Tiwary, Department of Applied Mathematics, Charles University [Prague] 19:20-19:45 (25min) › Few Induced Disjoint Paths for H-Free Graphs - Barnaby Martin, Durham University 19:45-20:10 (25min) 18:30 - 20:10 (1h40) Session 12 : Non-linear optimization Zoom Link B (chairman: Sven Mallach) › 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:30-18:55 (25min) › An outer-approximation algorithm for maximum-entropy sampling - Marcia Fampa, Universidade Federal do Rio de Janeiro 18:55-19:20 (25min) › Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization - Prashant Palkar, Prashant Palkar 19:20-19:45 (25min) › A Quadratic Simplex Algorithm for Primal Optimization over Zero-One Polytopes - Sven Mallach, University of Bonn 19:45-20:10 (25min)	Session 13 : Graphs and Trees Session 14 : Biology/Health applications 13:00 - 14:30 (1h30) Session 13 : Graphs and Trees Zoom Link A (chairman: Diego Delle Donne) › On the Thinness of Trees - ERIC BRANDWEIN, Universidad de Buenos Aires [Buenos Aires] 13:00-13:30 (30min) › 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:30-14:00 (30min) 13:00 - 14:30 (1h30) Session 14 : Biology/Health applications Zoom Link B (chairman: Pierre Fouilhoux) › Optimal Vaccination Strategies for Multiple Dose Vaccinations - Jenny Segschneider, RWTH Aachen University 13:00-13:30 (30min) › One transfer per patient suffices: Structural insights about patient-to-room assignment - Sigrid Knust, University of Osnabrück 13:30-14:00 (30min) › Finding synonymous coding DNA sequences with maximum base pairing - Andrea D'Ascenzo, Università degli Studi dell'Aquila 14:00-14:30 (30min) Break (join us at Gather Town) 14:30 - 15:00 (30min) Break (join us at Gather Town) Invited Lecture 3 : Petra Mutzel 15:00 - 16:00 (1h) Invited Lecture 3 : Petra Mutzel Zoom link for Plenary Sessions https://isco2022.sciencesconf.org/data/program/Petra.pdf Break (join us at Gather Town) 16:00 - 16:30 (30min) Break (join us at Gather Town) Session 15 : Theory of combinatorics Session 16 : Algorithms 16:30 - 18:00 (1h30) Session 15 : Theory of combinatorics Zoom Link A (chairman: Daniele Catanzaro) › On Minimally Non-Firm Binary Matrices - Reka Agnes Kovacs, Mathematical Institute [Oxford] 16:30-16:55 (25min) › Characterizing Path-Length Matrices of Unrooted Binary Trees - Daniele Catanzaro, Daniele Catanzaro, Center of Operations Research and Econometrics (CORE) Universit ́e Catholique de Louvain 17:00-17:30 (30min) 16:30 - 18:00 (1h30) Session 16 : Algorithms Zoom Link B (chairman: Ridha Mahjoub) › Locating Obnoxious Facilities on a Line Segment - Vishwanath Reddy Singireddy, Birla Institute of Technology and Science, Pilani, Hyderabad Campus 16:30-17:00 (30min) › An Efficient Post-Synthesis of Reversible Circuits - Raphael Lima, Universidade Federal Fluminense 17:00-17:30 (30min) Break (join us at Gather Town) 18:00 - 18:30 (30min) Break (join us at Gather Town) Invited Lecture 4 : Jon Lee 18:30 - 19:30 (1h) Invited Lecture 4 : Jon Lee Zoom link for Plenary Sessions https://isco2022.sciencesconf.org/data/program/Jon.pdf Closing Session 19:30 - 19:40 (10min) Closing Session Closing Session

Online user: 17

Privacy