Program

**The talk of Ricardo Fukawasa was voted the best talk of the workshop.**

The workshop will start on Sunday, May 22, in the late afternoon with registration and a welcome reception, and will end before dinner on Wednesday, May 25. There will be an excursion on Tuesday afternoon and a workshop dinner on Tuesday evening.

There will be a single track of around 30 talks to be selected using a first-come, first-serve policy.

Detailed program.

• Solving Bin Packing Problems with Fragmentation
  M. Casazza, A. Ceselli
• On the solution of some very large-scale, highly degenerate combinatorial optimization problems: Applications to clustering
  D. Aloise, C. Contardo
• Selective pricing in branch-and-price algorithms for vehicle routing
  G. Desaulniers, D. Pecin, C. Contardo
• Pricing problems
  J. Desrosiers, J.-B. Gauthier, M.E. Lübbecke
• Integral Column Generation
  I. El Hallaoui, A. Tahir, G. Desaulniers
• Branch-and-Benders-Cut Algorithms for the Single Source Capacitated Facility Location Problem
  F. Enderer, C. Contardo, B. Gendron
• A Joint Routing and Speed Optimization Problem
  F. Santos, R. Fukasawa, Q. He, Y. Song
• Branch-and-cut (and-price) for the chance constrained vehicle routing problem
  R. Fukasawa, T. Dinh, J. Luedtke
• Cycle decomposition on network flow problems
  J. Desrosiers, J.-B. Gauthier
• Column Generation with the Primal-Dual Interior Point Method
  J. Gondzio, P. González-Brevis, P. Munari
• Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques
  T. Gschwind, S. Irnich, F. Furini, R. Woler Calv
• A Branch and Price Approach for Deployment of Cloud Services
  A.N. Gullhav, B. Nygreen
• Column Generation for the Nurse Rostering Problem: Improved Lower and Upper Bounds
  H. Gambini Santos, R.A.M. Gomes, R.Â. Machado Toffolo
• Pseudo-polynomial formulations for bin packing and cutting stock problems
  M. Delorme, M. Iori
• Branch-Price-and-Cut for the Active-Passive Vehicle-Routing Problem
  C. Tilk, N. Bianchessi, M. Drexl, S. Irnich, F. Meisel
• The tail assignment problem with look-ahead maintenance constraints
  S.J. Maher, G. Desaulniers, F.Soumis
• Improved Lower Bounds using lm-SRCs for the Capacitated Arc Routing Problem
  R. Martinelli, M. Malta, M. Poggi
• A column generation approach for correlated random vector generation
  A.L. Medaglia, O. Guaje, J. Sefair
• p-step formulations for vehicle routing problems: a generalized class of models based on column generation
  P. Munari
• The Cross-dock Door Assignment Problem
  W. Nassief, I. Contreras, B. Jaumard
• Improvements to a Branch-Cut-and-Price Algorithm for the Exact Solution of Parallel Machines Scheduling Problems
  D. Oliveira, A. Pessoa
• Limited-memory subset-row cuts for VRP
  D. Pecin, C. Contardo, G. Desaulniers, A. Pessoa, M. Poggi, E. Uchoa
• Separation, Inverse Optimization, and Decomposition: Some Observations
  T. Ralphs, A. Bulut
• The Fixed Charge Transportation Problem: A Strong Formulation Based On Lagrangian Decomposition and Column Generation
  Y. Zhao, T. Larsson, E. Rönnberg
• A novel column-generation matheuristic to Volumetric Modulated Arc Therapy (VMAT) treatment planning
  L.-M. Rousseau, M. Mahnam, M. Gendreau, N. Lahrichi
• Recent results for column generation based diving heuristics
  R. Sadykov, F. Clautiaux, M. Gérard, A. Pessoa, I. Tahiri, F. Vanderbeck, E. Uchoa
• Column Generation with Dynamic Constraint Aggregation in the Master Problem
  F. Soumis
• The Pickup and Delivery Problem with Scheduling at the Dock
  V.A.A. Souza, G.R. Mateus
• Large-Scale optimization of the Unit Commitment Problem for medium-term Simulations of Energy Systems
  A. Taverna, A. Ceselli, G. Righini, D. Siface
• Application of Dantzig-Wolfe Reformulation to Binary Quadratic Problems
  A. Ceselli, L. Létocart, E. Traversi
• Column generation for vector packing with bounds from multidimensional dual-feasible functions
  C. Alves, J. Valério de Carvalho, F. Clautiaux, J. Rietz
• Column Generation for Airline Crew Planning and Scheduling – implementation and research directions for solving industrial problems
  D. Villeneuve, N. Lingaya
• Dantzig-Wolfe Reformulations for the Stable Set Problem
  J. Witt, M. Lûbbecke
• An approach based on Column Generation for solving routing problems with fractional objective function
  J. André, R. Baldacci, R. Fokouop, L. Létocart, E. Traversi, R. Wolfler Calvo