Program

TA-01: Opening session
Stream: Opening and closing
Room: L226
Chair(s): Jacek Blazewicz

TB-01: Plenary My T. Tai
Stream: Plenary
Room: L226
Chair(s): Jacek Blazewicz

• Accelerating viral marketing: From combinatorial strategies to learning-based solutions
  My Thai

TC-01: Algorithms
Stream: Algorithms
Room: L226
Chair(s): Jedrzej Musial

• A combinatorial optimization approach to query-guided document set expansion
  Arne Deloose, Jan Verwaeren, Bernard De Baets
• Algorithms supporting analysis of mass spectra of metabolites and lipids
  Marcin Borowski
• Exact algorithms for the satellite image selection problem
  Tomasz Żok, Sylwester Swat, Maciej Antczak, Jedrzej Musial
• Satellite Image Mosaic Selection Problem: Current state and research directions
  Jedrzej Musial, Jacek Blazewicz

TC-02: Scheduling
Stream: Scheduling
Room: M228
Chair(s): Stanislaw Gawiejnowicz

• Makespan minimization for independent jobs with shared additional operations on parallel identical machines
  Joanna Berlińska, Yakov Zinder, Bertrand Lin
• Tactical assembly line feeding problem
  Gohar Porbar, El-Houssaine Aghezzaf, Veronique Limère, Emmanouil Thanos
• Optimal rescheduling with new jobs under bounded disruption
  Ulrich Pferschy, Stefan Lendl, Elena Rener
• Job scheduling in time-dependent shop systems
  Stanislaw Gawiejnowicz

TD-01: Data structures
Stream: Data structures
Room: L226
Chair(s): Jeroen Gardeyn

• Ordered interactions in combinatorial problems
  Alberto Torrejón Valenzuela, Justo Puerto, Víctor Blanco
• A 3-space dynamic programming heuristic journey for the cubic knapsack problem
  Franklin Djeumou Fomeni, Ibrahim Dan Dije, Leandro Coelho
• An exact approach for minimizing permission-switching overhead in control-flow graphs
  Jeroen Gardeyn, Adriaan Jacobs

TD-02: Heuristic scheduling
Stream: Heuristic scheduling
Room: M228
Chair(s): Leyla Demir

• The stochastic procurement and production lot-sizing problem: Models and a sample average approximation approach
  Caio Tomazella, Raf Jans, Maristela Santos, Douglas Alem
• Optimization of integrated reverse supply chain and rebalancing of disassembly lines with integer programming and constraint programming
  Zeynel Abidin CIL, Suleyman Mete, Stefan Nickel
• Population-based heuristic algorithms for buffer allocation in unreliable production lines
  Leyla Demir, Mehmet Ulaş KOYUNCUOĞLU

TE-01: Travelling salesperson
Stream: Travelling salesperson
Room: L226
Chair(s): Peter H, Richter

• Rescheduling strategies for a dynamic visit scheduling problem of a salesperson
  Mualla Gonca Avci, Melisa Akkus, Aybuke Onar
• A solvable case of the Path-TSP on Van der Veen distance matrices
  Eranda Cela, Vladimir Deineko, Gerhard Woeginger
• The time-consistent travelling salesman problem
  Juan José Salazar González, Daniel Díaz-Ríos
• The Generalized Traveling Salesman Path Problem GTSPP – An impactful construction algorithm
  Peter H, Richter

TE-02: Timetabling
Stream: Timetabling
Room: M228
Chair(s): Pieter Smet

• A scheduling problem with restricted work/days-off periods
  Fabien Nießen, Paul Paschmanns
• Efficient constraint evaluation for the nurse rostering problem
  Robin Tourlamain
• The Integrated Healthcare Timetabling Competition 2024
  Pieter Smet, Sara Ceschia, Roberto Maria Rosati, Andrea Schaerf, Greet Vanden Berghe, Eugenia Zanazzo

FA-01: WOG OR4Logistics Plenary Stefan Irnich
Stream: Plenary
Room: L226
Chair(s): Greet Vanden Berghe

• Shortest Path Problems With Resource Constraints
  Stefan Irnich

FB-01: Complexity
Stream: Complexity
Room: L226
Chair(s): Patrick De Causmaecker

• On SAT information content, its polynomial-time solvability and fixed code algorithms
  Maciej Drozdowski
• Complexity of the uniqueness problem of a minimum vertex cover in a graph
  Olivier Hudry
• The constrained bottleneck spanning tree problem with upgrades
  Bryan Coulier, Hatice Calik, Greet Vanden Berghe
• Dedekind Numbers, counting monotone Boolean functions on a finite set: formula's and complexity issues.
  Patrick De Causmaecker

FB-02: Machine learning
Stream: Machine learning
Room: M228
Chair(s): Piotr Lukasiak

• A machine learning-based solution approach for solving the sustainable biomass supply chain network design problem
  Pinar Yunusoglu, Fehmi Burcin Ozsoydan, Bilge Bilgen
• Learning to branch with interpretable machine learning models
  Nikolaos Sahinidis, Selin Bayramoglu, George Nemhauser
• Topology classification using a Multiple Kernel Learning approach with graphs and non-graphable data
  Maciej Majchrzak, Piotr Lukasiak
• Approaches to the use of machine learning for medical problems
  Piotr Lukasiak, Maciej Majchrzak

FC-01: Graphs
Stream: Graphs
Room: L226
Chair(s): Alain Hertz

• Bounds on the number of non-equivalent colorings of a graph
  Valentin Dusollier, Alain Hertz, Hadrien Mélot
• Interaction graphs as a way to discover multiplexes in nucleic acid structures.
  Michal Zurkowski, Marta Szachniuk, Tomasz Żok
• New methodology for Hypergraph Clustering
  Francisco Temprano Garcia, Stefano Benati, Justo Puerto
• Extremal chemical graphs for the arithmetic-geometric Index
  Alain Hertz, Sébastien Bonte, Gauvain Devillez, Valentin Dusollier, Hadrien Mélot, David Schindl

FC-02: Logistics
Stream: Logistics
Room: M228
Chair(s): Hannah Verplancke

• An rVNS metaheuristic to optimize airport ground-handling: a focus on catering operations assignment.
  Alexandre Dupaquis, Ronan Guivarch, Sandrine Mouysset, Daniel Ruiz, Vincent Charvillat, Frédéric Bouilhaguet
• A complete algorithm for the truck driver scheduling problem?
  Niels De Walsche, Greet Vanden Berghe, Pieter Smet
• A mathematical programming-based heuristic for the perishable inventory routing problem with product substitution
  Mustafa Avci, Mualla Gonca Avci
• The strategic assembly line feeding problem
  Hannah Verplancke, Veronique Limère, El-Houssaine Aghezzaf, Emmanouil Thanos

FD-01: Fairness
Stream: Fairness
Room: L226
Chair(s): Lisa Garcia Tercero

• When does solving just-in-time scheduling problem with non-restrictive due date guarantee solution to the CON problem with same performances?
  Ameur SOUKHAL, Nguyen HUYNH-TUONG
• Randomized strategyproof mechanisms with best of both worlds fairness and efficiency
  Bo Chen, Ankang Sun
• Minimal and fair presence times for single-day sports tournaments with multiple fields
  Lisa Garcia Tercero, Dries Goossens, David Van Bulck

FE-01: Plenary Thomas Magnanti
Stream: Plenary
Room: L226
Chair(s): Paolo Toth

• Designing Transportation and Telecommunications Networks
  Thomas Magnanti

SA-01: Location optimization
Stream: Location optimization
Room: L226
Chair(s): Felix Rauh

• Improved p-center problem solutions
  Alfredo Marín
• Charging ahead: Optimal location of wireless power transfer systems to electrify urban roads
  Thomas Byrne, Yudai Honma
• New results about the stochastic single-allocation hub location problem
  Inmaculada Espejo, Alfredo Marín, Juan Manuel Muñoz-Ocaña, Raúl Páez, Antonio Manuel Rodriguez-Chia
• Maximum covering network design for improving health care access
  Felix Rauh, Jannik Matuschke, Hande Yaman

SB-01: Plenary El-Ghazali Talbi
Stream: Plenary
Room: L226
Chair(s): Tony Wauters

• Metaheuristics for the automated design and configuration of Deep Neural Networks
  El-Ghazali Talbi

SC-01: Closing session
Stream: Opening and closing
Room: L226
Chair(s): Van-Dat CUNG