|
|
Detailed schedule
Click on a link for more details
Show all the abstracts
Thursday 30 January:
Thursday 11:15-12:30 TA-1: COMEX - Optimization 1 Room Vesale 023 - Chair: M. Schyns
Thursday 11:15-12:30 TA-2: Software and Implementation Room Vesale 020 - Chair: M. Mezmaz
Thursday 11:15-12:30 TA-3: COMEX - Smart mobility Room Vesale 025 - Chair: A. Caris
Thursday 11:15-12:30 TA-4: Systems Room Pentagone 0A11 - Chair: P. Kunsch
Thursday 14:00-15:40 TB-1: Data Analysis 1 Room Vesale 023 - Chair: X.Siebert
Thursday 14:00-15:40 TB-2: Multiple Objectives Room Vesale 020 - Chair: Y. de Smet
Thursday 14:00-15:40 TB-3: Logistics Room Vesale 025 - Chair: D. De Wolf
Thursday 14:00-15:40 TB-4: COMEX - Applications to Economy Room Pentagone 0A11 - Chair: W. Brauers
Thursday 14:00-15:40 TB-5: Networks Room Pentagone 0A07 - Chair: B. Fortz
Thursday 16:10-17:25 TC-1: Mixed-integer nonlinear programming Room Vesale 023 - Chair: Y. Crama
Thursday 16:10-17:25 TC-2: Decision Analysis 1 Room Vesale 020 - Chair: S. Eppe
Thursday 16:10-17:25 TC-3: Routing Room Vesale 025 - Chair: K. Sörensen
Thursday 16:10-17:25 TC-4: Graphs Room Pentagone 0A11 - Chair: H. Mélot
Thursday 16:10-17:25 TC-5: Scheduling Room Pentagone 0A07 - Chair: S. Hanafi
Friday 9:00-10:15 FA-1: Queuing Room Vesale 023 - Chair: S. Wittevrongel
Friday 9:00-10:15 FA-2: Decision Analysis 2 Room Vesale 020 - Chair: R. Bisdorff
Friday 9:00-10:15 FA-3: COMEX - Optimization 2 Room Vesale 025 - Chair: M. Labbé
- Competitive analysis of on-line algorithms : applications to Operations Research.
Claudio Telha Cornejo (Université Catolique de Louvain) Co-authors: Mathieu Van Vyve Abstract: On-line algorithms are procedures designed to operate over streams of requests. When new requests arrive, they must take action to satisfy them immediately. These actions often turn out to be non-optimal because of the uncertainty on future requests.
On-line algorithms became an important algorithmic paradigm in computer science, because of the intrinsic serial nature of several computational processes, and the need for quick procedures that permanently operate over them. For optimization problems, researchers developed a formal framework for on-line algorithms, with the notion of competitive analysis as indicator of performance of these algorithms.
In this talk, we motivate the competitive analysis of on-line algorithms from the perspective of operational research, by describing some applications to capacity acquisition, maintenance scheduling and lot-sizing problems.
- Novel Formulations for Stackelberg Security Games
Carlos Casorrán-amilburu (ULB) Co-authors: Bernard Fortz, Martine Labbé, Fernando Ordóñez
- On the complexity of separation: the three-index assignment problem
Frits Spieksma (KU Leuven) Co-authors: T. Dokka and I. Mourtos
Friday 9:00-10:15 FA-4: Production Room Pentagone 0A11 - Chair: D. Tuyttens
Friday 14:00-15:40 FB-1: Data Analysis 2 Room Vesale 023 - Chair: P. Fortemps
Friday 14:00-15:40 FB-2: Heuristics Room Vesale 020 - Chair: T. Stützle
Friday 14:00-15:40 FB-3: COMEX - Transportation Room Vesale 025 - Chair: F. Spieksma
Friday 14:00-15:40 FB-4: Health Room Pentagone 0A11 - Chair: G. Vanden Berghe
|
|