View the program in our Progressive Web App
Program for stream Discrete Optimization and Algorithms (contributed)
Sunday
Monday
Monday, 8:30-10:00
MA-13: Trip planning and network desingn
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Valentina Morandi
-
Approximate dynamic programming for liner shipping network design
Sangmin Lee -
Multi-Agent Trip Planning with Activity Reservations in Crowded Destinations
Joris Slootweg, Rob van der Mei -
A centralized decision support system to determine optimal paths for visitors of crowded events
Valentina Morandi -
Online Algorithms for Multi-Agent Tourist Trip Planning Problems
Jesse Nagel
Monday, 10:30-12:00
MB-13: Applications in Discrete Optimization I
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Richard Lusby
-
Solar Farm Cable Layout Optimization as a Graph Problem
Sascha Gritzbach, Dominik Stampa, Matthias Wolf -
Cutting Plane Techniques for Robust Kidney Exchange Models
Danny Blom, Christopher Hojny, Bart Smeulders -
A heuristic approach to integrate train timetabling, platforming, and railway network maintenance scheduling decisions
Richard Lusby, Qin Zhang, Pan Shang, Xiaoni Zhu
Monday, 12:30-14:00
MC-13: Applications in Discrete Optimization II
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Felix Hennings
-
Optimizing transient gas network control for challenging real-world instances using MIP-based heuristics
Felix Hennings, Kai Hoppmann-Baum -
Graph Theory and Cost-Benefit Analysis for Optimizing and Evaluating Networked-Infrastructures Transitions: A Case Study on Wastewater Infrastructure's Mergers in England
Yasmin Jaaron, David Saal -
Multi-stage Heuristic for Facility Management
Arezoo Vejdanparast, Andre Maravilha, Felipe Campelo, Aniko Ekart, Randa Herzallah -
New research exploiting a local precomputed cost function for the nuclear outage planning problem
Rodolphe griset, Saad Balbiyad, Luis Marques
Monday, 14:30-16:00
MD-13: Polyhedral Combinatorics
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Cécile Rottner
-
Polyhedral study of min-up/min-down polytope variants
Cécile Rottner -
Hypergraph and Strong Valid Inequalities for Boolean Logical Pattern Generation
Dongwoo Kang, Hong Seo Ryoo -
Two Hard Problems In Box-Total Dual Integral Polyhedra
Francesco Pisanu
Tuesday
Tuesday, 8:30-10:00
TA-13: Scheduling problems
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Christos Zacharias
-
Dynamic Inter-day and Intra-day Scheduling
Christos Zacharias, Nan Liu, Mehmet Begen -
Single-machine scheduling with an external resource
Morteza Davari, Dirk Briskorn, Jannik Matuschke -
A Hybrid Metaheuristic for the Optimization of Job Shop Scheduling Problem with Transport Resources
Dalila Fontes, S. Mahdi S. Homayouni, Fernando A. C. C. Fontes -
Greedy Algorithms for Solving the Resource Sharing and Scheduling Problem
Gavriel David Pinto, Yehuda Hassin, Daniel Lifshitz, Inessa Ainbinder, Gad Rabinowitz
Tuesday, 10:30-12:00
TB-13: Scheduling applications
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Pablo A. Rey, Tal Grinshpoun
-
A Decentralized Problem Decomposition Scheme for Sequencing and Scheduling: Application in Outpatient Appointment Systems
Pardis Seyedi, Michael Carter, Kourosh Eshghi -
Investigating Hyper-heuristics for Real-World Test Laboratory Scheduling
Florian Mischek, Nysret Musliu -
Course Allocation with Friendships
Tal Grinshpoun, Ilya Khakhiashvili, Lihi Dery
Tuesday, 12:30-14:00
TC-13: Topics in graph theory
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Jose Brandao
-
Preconditioning methods for the winner determination problem
Sandor Szabo, Bogdan Zavalnij -
Robust optimization of weighted independent sets in trees and under interval uncertainty
Robert Manger, Ana Klobučar Barišić -
Reducing transitive tournament problem to clique problem
Bogdan Zavalnij, Sandor Szabo -
A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
Jose Brandao
Tuesday, 14:30-16:00
TD-13: Topics in Discrete Optimization I
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Alfredo G. Hernandez-Diaz
-
The Class-Teacher Assignment Problem and its application in Educational Timetabling
Claudio Crobu -
Localization under two conflicting perspectives: Proximity or fair share?
Alfredo G. Hernandez-Diaz -
A new heuristic approach to the robust team formation problem
Goranka Nogo -
New heuristics for solving the Three-index Assignment Problem
Mohamed Mehbali
Wednesday
Wednesday, 8:30-10:00
WA-13: Topics in Discrete Optimization II
Stream: Discrete Optimization and Algorithms (contributed)
Room: U119 (building U-wing)
Chair(s):
Marcel Turkensteen
-
Column-and-constraint generation for risk-averse two-stage stochastic programs
Jongheon Lee, Kyungsik Lee -
Incremental Maximum Satisfiability
Andreas Niskanen, Jeremias Berg, Matti Järvisalo -
Efficient computation of tolerances of combinatorial bottleneck problems
Marcel Turkensteen, Gerold Jäger