| Jeu. 12 | Ven. 13 | |
|
08:00
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
18:00
19:00
20:00
21:00
22:00
|
8:00 - 8:45 (45min)
Accueil
Accueil
8:45 - 9:00 (15min)
Ouverture des journées
Amphi S3 043
9:00 - 9:50 (50min)
Some Combinatorial Optimization Techniques for Scheduling with Due Dates
Amphi S3 043
R. Mhallah
9:50 - 10:20 (30min)
Éléments d'étude polyèdrale du placement d'un réseau virtuel
Amphi S3 043
A. Schneider
10:20 - 10:50 (30min)
Pause café
10:50 - 11:20 (30min)
Egalités valides pour le problème d'arbre de classification univarié optimal
Amphi S3 043
Z. Ales
11:20 - 11:50 (30min)
Reconnaissance des graphes bivalents ou trivalents
Amphi S3 043
A. Knippel
12:00 - 13:30 (1h30)
Déjeuner
Restaurant universitaire
13:30 - 14:20 (50min)
Open Problems (that I like)
Amphi S3 043
R. Grappe
14:20 - 14:50 (30min)
A mixed-integer linear programming model for data collection from buried sensors with a drone
Amphi S3 043
Y. Hu
14:50 - 15:20 (30min)
A neighborhood for Pickup and Delivery Problem with Cooperative Robots
Amphi S3 043
C. T. NGUYEN
15:20 - 15:50 (30min)
Pause café
15:50 - 16:20 (30min)
The Interplay of Domination and Separation in Graphs
Amphi S3 043
A. Wagler
16:20 - 16:50 (30min)
Integrating Fairness in a Large-Scale Many-to-Many Assignment Problem
Amphi S3 043
J. Nicolas-Thouvenin
19:00 - 22:00 (3h)
Repas de Gala
Repas de Gala au Café Mancel, Château de Caen
|
9:00 - 9:50 (50min)
Solving Mixed Integer Non Linear Programs via Constrained Smooth Additive Regression Models
Amphi S3 043
C. D’ Ambrosio
9:50 - 10:20 (30min)
Algorithmes de coupes et branchements pour le problème de l'arbre couvrant d-budgété
Amphi S3 043
C. Nourry
10:20 - 10:50 (30min)
Pause café
10:50 - 11:20 (30min)
Optimiser des programmes SDP largement réalisables via une formulation polyhédrale
Amphi S3 043
D. Porumbel
11:20 - 11:50 (30min)
Totally equimodular matrices: decomposition and triangulation.
Amphi S3 043
M. Vallée
12:00 - 13:30 (1h30)
Déjeuner
13:30 - 14:20 (50min)
Totally nonnegative matrices and associated matroids
Amphi S3 043
S. Launois
14:20 - 14:50 (30min)
Decision-dependent information discovery for a variant of the selection problem
Amphi S3 043
X. Chen
14:50 - 15:20 (30min)
Bundle Network : a Machine-Learning Based Bundle Method
Amphi S3 043
F. Demelas
15:20 - 15:20 ()
Pot de clôture
|