Program

The workshop will start on Sunday, June 10, in the late afternoon with registration and a welcome dinner and will end in mid-afternoon on Wednesday, June 13. There will be an excursion in the afternoon on June 12.

• The fire and rescue vehicle location problem
  H. Andersson, T. Andersson Granberg


• Column generation for the cut packing problem
  M. Bergner, M. Lübbecke


• Location and routing problems: a unified approach
  A. Ceselli, G. Righini, E. Tresoldi


• Using strong degree constraints to impose partial elementarity in shortest path problems under resource constraints
  C. Contardo, G. Desaulniers


• Branch and price for hub location problems with single assignment
  I. Contreras, E. Fernández


• A column generation approach for the bi-objective max-min knapsack problem
  J. M. Valério de Carvalho, C. Alves, R. Mansi, T. Pinto


• Stabilized dynamic constraint aggregation for solving set partitioning problems
  J. Desrosiers, P. Benchimol, G. Desaulniers


• Branch-and-price for vehicle routing problems with multiple synchronization constraints
  M. Drexl


• Integral simplex using decomposition
  I. Elhallaoui, A. Zaghrouti, F. Soumis


• The horizon decomposition for capacity constrained lot size problems with setup times
  I. Fragkos, Z. Degraeve, B. De Reyck


• Not only column generation: the (stabilized) structured Dantzig-Wolfe decomposition method
  A. Frangioni, B. Gendron


• Row-reduced column generation
  J.-B. Gauthier, J. Desrosiers, M. Lübbecke


• Interior point methods and column generation
  J. Gondzio


• Just Say "No"... for the Wrong Variables
  E. Gorgone, A. Frangioni


• Column generation for the robust rescheduling of resources
  D. Huisman, L. Veelenturf, D. Potthoff, L. Kroon, G. Maroti & A. Wagelmans


• Challenging column generation models for the design of survivable IP-over-WDM networks
  B. Jaumard


• Pricing, relaxing and fixing under lotsizing and scheduling
  D. Klabjan, L. Guimaraes, B. Almada-Lobo


• Experiments with a generic branch-price-and-cut code
  M. Lübbecke


• Integrated airline recovery problem with a minimal disruption neighbourhood
  S. J. Maher


• Branch-cut-and-price for routing problems
  R. Martinelli, D. Pecin, M. Poggi, A. Pessoa, E. Uchoa


• Improved column generation for solving set partitioning problems
  A. Metrane, I. Elhallaoui, F. Soumis


• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
  I. Muter, S. Ilker Birbil, K. Bulbul


• Efficient ng-route pricing
  D. Pecin, R. Martinelli, M. Poggi


• Equipment/Operator task scheduling with BAPCOD
  M. Poggi, D. Pecin, M. Reis, C. Ferreira, K. Neves, R. Sadykov, F. Vanderbeck


• Large neighborhood search in column generation algorithms
  C. Puchert, M. Lübbecke


• Branch-price-and-cut for creating an annual delivery program of multi-product liquefied natural gas
  J. G. Rakke, H. Andersson, M. Christiansen, G. Desaulniers


• Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems
  S. Ropke


• Taking advantage of degeneracy in mathematical programming
  F. Soumis, A. Zaghrouti, I. Elhallaoui, G. Desaulniers, J. Desrosiers


• The time window assignment vehicle routing problem
  R. Spliet, A. F. Gabor


• A branch-and-price method for a ship routing and scheduling problem with cargo coupling and synchronization constraints
  M. Stalhane, H. Andersson


• Recoverable robustness by column generation
  M. van den Akker, P. Bouman, H. Hoogeveen, D. Tonissen


• Column generation stabilization using dual smoothing: theory and practice
  F. Vanderbeck, J. Han, P. Pesneau, A. Pessoa, R. Sadykov, E. Uchoa

Rooms

• Talks: Salon C
  
• Cocktail: Terrasse or Atrium
  
• Lunches and dinners: Salon Knowlton (except Tuesday's dinner)
  
• Tuesday's dinner: Auberge Bromont, Côté-Jardin room