7th International Symposium on Combinatorial Optimization (ISCO) 2022

›12:50 (10min)

Opening Session (Zoom link Plenary Session)

12:50 - 13:00 (10min)

Opening Session (Zoom link Plenary Session)

Opening Session

›13:00 (1h30)

Session 1 : Scheduling
(chairman: Fabrizio Rossi)

› Zoom Link A

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 (1h30)

Session 2 : Approximation algorithms I
(chairman: David Weckbecker)

› Zoom Link B

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)

›14:30 (30min)

Break (join us at Gather Town)

14:30 - 15:00 (30min)

Break (join us at Gather Town)

›15:00 (1h40)

Session 3 : Routing Problems
(chairman: Luis Gouveia)

› Zoom Link A

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 (1h40)

Session 4 : Heuristics
(chairman: Nelson Maculan)

› Zoom Link B

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)

›16:40 (20min)

Break (join us at Gather Town)

16:40 - 17:00 (20min)

Break (join us at Gather Town)

›17:00 (1h40)

Session 5 : Polyhedra and algorithms
(chairman: Santanu Dey)

› Zoom Link A

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 (1h40)

Session 6 : Cutting and Packing
(chairman: Javier Marenco)

› Zoom Link B

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)

›18:40 (20min)

Break (join us at Gather Town)

18:40 - 19:00 (20min)

Break (join us at Gather Town)

›19:00 (1h)

Invited Lecture 1 : Rekha R. Thomas

› Zoom link for Plenary Sessions

19:00 - 20:00 (1h)

Invited Lecture 1 : Rekha R. Thomas

Zoom link for Plenary Sessions

https://isco2022.sciencesconf.org/data/program/Rekha.pdf