14th International Workshop on Combinatorial Optimization
Aussois, 4-8 january 2010
  *    Welcome
  *    Participants
  *    Program
  o    Monday
  o    Tuesday
  o    Wednesday
  o    Thursday
  o    Friday
  *    Accommodation
  *    Registration
  *    Travel information

Tuesday January 5

Morning session


Chair : P. Toth
08:30 A. Lodi Interdiction Branching slides
09:00 V. Cacchiani A Lagrangian Heuristic for Robust Train Timetabling slides slides
09:30 E. Balas Intersection cuts from multiple-term disjunctions slides slides
10:00 Coffee break
Chair : J.-F. Maurras
10:30 S. Fiorini Hitting Diamonds and Growing Cacti slides
11:00 A. Bley Approximability of 3- and 4-hop bounded disjoint paths problems slides slides
11:30 L. Sanita An Improved LP-based Approximation for Steiner Tree slides
12:00 Lunch


Afternoon session


Chair : F. Barahona
17:15 C. de Souza Minimum Caterpillar Trees and Ring-Stars: a branch-and-cut algorithm slides slides
17:45 S. Pokutta On the Rank of Cutting-plane Proof Systems slides slides
18:15 Break
18:30 P. Belotti Valid inequalities for multilinear functions slides
19:00 C. Buchheim An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming slides
19:30 Dinner

Valid HTML 4.01 Transitional Valid CSS!

website : Olivier Briant and Denis Naddef