# Submission

People who wish to make a
presentation during the workshop are invited to indicate
the title of their talk in the registration form.

The talks will be scheduled as far as possible.

# Program

### Thursday, December 8, 2016

09:45 - 10:00 ** Opening session **

10:00 - 10:25

Sparsest cut in planar graphs, maximum concurrent
flows and their connections with the max-cut problem

*
F. Barahona
*, M. Baiou

10:25 - 11:00 Coffee break

11:00 - 11:25

Mathematical models with a polynomial number of
variables and constraints for some NP-hard
combinatorial optimization problems in graphs

*
N. Maculan
*, Laura Bahiense, Arthur Besso

11:25 - 11:50

Computational Study of Some Valid Inequalities for
k-Way Graph Partitioning

*
M. Anjos
*, Vilmar Jefte Rodrigues de Sousa,
Sebastien Le Digabel

11:50 - 12:15

Relay Location and Network Design

*
H. Yaman
*, Aris Yildiz, Oya Ekin Karasan

12:15 - 14:20 Lunch

14:20 - 14:45

Maman les petits bateaux

*
J. F. Maurras
*

14:45 - 15:10

Reducing some graph parameter via minimal edge contractions

*
C. Picouleau
*

15:10 - 15:35

The Stochastic Shortest Path Problem: A polyhedral
combinatorics perspective

*
G. Stauffer
*

15:35 - 16:00

Extended (Weird) Flow based Models for the (PC)ATSP

*
L. Gouveia
*, P. Pesneau, M. Ruthmair, D. Santos

16:00 - 16:30 Coffee break

16:30 - 16:55

High-dimensional risk-constrained dynamic asset allocation via
Markov stochastic dual dynamic programming

*
M. Poggi
*, Davi Valadão, Thuener Silva

16:55 - 17:20

Vertex k-Separator Problem

*
F. Furini
*

17:20 - 17:45

The split-demand one-commodity pickup-and-delivery
travelling salesman problem

*
J.J. Salazar Gonzalez
*, Beatriz Santos

19:30 - Gala dinner

### Friday, December 9, 2016

09:15 - 09:40

Tight MIP formulations for unit commitment and
production planning problems with bounded up/down
times

*
M. Queyranne
*, L. Wolsey

09:40 - 10:05

Some mathematical gems in Distance Geometry

*
L. Liberti
*, Carlile Lavor

10:05 - 10:30

Distance Transformation for Network Design Problems

*
E. Uchoa
*, A.R. Mahjoub, M. Poss, L. Simonetti

10:30 - 11:00 Coffee break

11:00 - 11:25

The Polyhedral Lens

*
A. Sebo
*

11:25 - 11:50

On the Convex Piecewise Linear Unsplittable
Multicommodity Flow Problem

*
B. Fortz
*, Luís Gouveia, Martim Joyce-Moniz

11:50 - 12:15

Connectivity with Ridha

*
M. Baiou
*

12:15 - 12:40

Reduced-size formulations for metric and cut polyhedra
in sparse graphs

*
V. H. Nguyen
*, M. Minoux, D.P. Nguyen

12:40 - 14:30 Lunch

14:30 - 14:55

Min Cuts with Mahjoub and McCormick

*
S.T. McCormick
*, Ridha Mahjoub and others...

14:55 - 15:20

A Matheuristic for the Multicommodity Fixed-Charge
Network Design Problem

*
S. Hanafi
*, Bernard Gendron, Raca Todosijevic

15:20 - 15:45

Campaign planning optimization @ OM Partners

*
D. Huygens
*

15:45 - 16:15 Coffee break

16:15 - 16:40

Optimization in Mechanism Design

*
M. Pinar
*

16:40 - 17:05

A business dinner problem

*
F. Meunier
*, Alejandra Estanislao

17:05 - 17:30 ** Closing session **