Morning session 
Chair : G. Reinelt 
08:30 
G. Stauffer 
The Hidden MatchingStructure of the Composition of Strips: a Polyhedral Perspective 


09:00 
P. Ventura 
The stable set polytope of almost all clawfree graphs 
09:30 
T. Bonato 
Separation for the MaxCut Problem on General Graphs 


10:00 
Coffee break 
Chair : K. Aardal 
10:30 
S. Dey 
The ChvatalGomory Closure of an Ellipsoid is a Polyhedron 

11:00 
A. Wiegele 
First Experiments with Semidefinite Relaxations for NonConvex Quadratic Integer Programming 


11:30 
A. Gleixner 
Undercover  A primal heuristic for MINLP based on subMIPs generated by set covering 


12:00 
Lunch 

Afternoon session 
Chair : M. Labbé 
17:15 
A. Karrenbauer 
A 3/2approximation algorithm for ratemonotonic multiprocessor scheduling of implicit deadline tasks 
17:45 
D. Müller 
Faster MinMax Resource Sharing in Theory and Practice 
18:15 
Break 
18:30 
J. Hatzl 
The Inverse 1Median Problem in R^{d} with the TschebyscheffNorm 
19:00 
M. Pocchiola 
On the connectedness of oneextension spaces of double pseudoline arrangements 

19:30 
Dinner 