PROGRAM
Monday 5
09:00-09:15
The Organizers
Welcome
09:15-09:45
Martin Skutella
Preemptive Scheduling with Rejection
09:45-10:15
Marc Uetz
Approximation Results for Scheduling under Uncertainty

10:45-11:15
Viet Hung Nguyen
A Procedure of Facets Composition for the Symmetric Traveling Salesman Polytope
11:15-11:45
Juan José Salazar González
A Branch-and-Cut Algorithm for a Pickup-and-Delivery TSP
11:45-12:15
Marco Lübbecke
Combinatorial Restrictions on Pickup and Delivery Paths

17:30-18:00
Reinhardt Euler
Hajos' Construction and Polytopes
18:00-18:30
Volker Kaibel
Reconstructing a Simple Polytope from its Graph
18:30-19:00
Gerald Gruber
Lagrangean Relaxations for Max-Cut Using Bundle Methods

Tuesday 6
09:00-09:30
Francesco Maffioli
Base-Matroids and Inverse Problems
09:30-10:00
Gerhard Woeginger
Scheduling with Buffers
10:00-10:30
Matteo Fischetti
Solution of Very Large Scale Crew Scheduling Problems

11:00-11:30
Adam Letchford
Primal Cutting Plane Methods Revisited
11:30-12:00
Jean-Philippe Richard
Mixed Integer Programming: News Cuts and a Gomory Type Algorithm
12:00-12:30
Raymond Hemmecke
Decomposition of Test Sets for (Mixed)-Integer Programs

17:30-18:00
Jean François Maurras
The Polyhedron of the No
18:00-18:30
Marcus Oswald
Some Relations Between Consecutive Ones and Betweenness Polytopes
18:30-19:00
Laurence Wolsey
On the Wagner-Whitin Polytope

Wednesday 7
09:00-09:30
Ellis Johnson
Cyclic Groups and Knapsack Polyhedra
09:30-10:00
Andrea Lodi
ATSP Computation
10:00-10:30
Karen Aardal
Hard Integer Equality Constrained Knapsack Problems

11:00-11:30
Kathie Cameron
Induced Matchings and Strong Colorings in Intersection Graphs
11:30-12:00
Ismael de Farias
A Branch-and-Cut Approach to Cardinality Constrained Optimization Problems
12:00-12:30
William Pulleyblank
Protein Folding and Petaflop Computing

Chair:William Pulleyblank
17:30-19:00
Special Session for Jack Edmonds

Thursday 8
09:00-09:30
Robert Weismantel
The Integral Basis Method
09:30-10:00
Bianca Spille
A Combinatorial Algorithm for the Independent Path-Matching Problem
10:00-10:30
Jozsef Bekesi
The Matrix Transpose Problem on Bused Meshes

11:00-11:30
Rüdiger Schultz
Classical and Non-Classical Multi-Stage Stochastic (Integer) Programs
11:30-12:00
Morten Riis
Applying the Minimum Risk Criterion in Stochastic Resource Programs
12:00-12:30
Edoardo Amaldi
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem

17:30-18:00
Petra Mutzel
Map Labelling
18:00-18:30
Anja Remshagen
Learning in a Compiler for the SAT and MINSAT
18:30-19:00
Frederik Stork
Algorithms for AND/OR-Networks

Friday 9
09:00-09:30
Denis Naddef
The Domino Inequalities for the TSP
09:30-10:00
Günter Rote
Towards First Integer Programming Algorithms in Two or Three Dimensions
10:00-10:30
Alberto Caprara
On the Separation of Split Sets

11:00-11:30
Philippe Meurdesoif
Quadratizations of the Graph Coloring Problem Using Semidefinite Programming
11:30-12:00
Lisa Fleischer
On Minimum Cost Vertex Connectivity Problems
12:00-12:30
Jack Edmonds
Submodular Functions, Matroids, and Certain Polyhedra