PROGRAM
Monday 7
13:30-13:45
The Organizers
Welcome

13:45-14:30
Gérard Cornuéjols
Polyhedral Approaches to Mixed Integer Linear Programming

14:45-15:30
William Cook
50+ Years of Combinatorial Integer Programming

16:00-16:45
Laurence Wolsey
Decomposition and Reformulation in Integer Programming

Chair:George Nemhauser and William Pulleyblank
17:00-19:45
The Pioneers
Panel: 50 Years of Integer Programming


Tuesday 8
Chair:Giovanni Rinaldi
08:30-09:15
Ralph Gomory
40 Years of Corner Polyhedra
09:15-09:45
Ricardo Fukasawa
Numerically Accurate Gomory Mixed Integer Cuts
09:45-10:15
Adam Letchford
Separation Algorithms for the 0-1 Knapsack Polytope

Chair:Gerhard Reinelt
10:45-11:15
Matteo Fischetti
Looking inside Gomory
11:15-11:45
Francisco Barahona
On the Integrality of the Facility Location Polytope
11:45-12:15
Mourad Baiou
On the Linear Relaxation of the p-Median Problem

Chair:Laurence Wolsey
17:15-18:00
Jean-Philippe Richard
Group Relaxations for Integer Programming
18:00-18:30
Santanu Dey
Facets of High-Dimensional Infinite Group Problem
18:30-19:00
Kati Wolter
C-MIR Approach for Flow Cover Cuts
19:00-19:30
Andrea Tramontani
Experiments with Split Cuts


Wednesday 9
Chair:Paolo Toth
08:30-09:15
Francois Margot
Symmetry in Integer Programming
09:15-09:45
Ugo Pietropaoli
A New Algorithm for the Stable Set Problem in Claw-free Graphs
09:45-10:15
Claudio Gentile
Gear Composition and the Stable Set Problem

Chair:Martin Grötschel
10:45-11:15
Klaus Truemper
A Linear SAT Algorithm for Certain 2CNF/3CNF Formulas
11:15-11:45
Annegret Wagler
From Experimental Data to Biological Models
11:45-12:15
Alexander Bockmayr
Integer Programming and Metabolic Networks

Chair:Claude Lemaréchal
17:15-18:00
Franz Rendl
Semidefinite Relaxations for Integer Programming
18:00-18:30
Kurt Anstreicher
A Computable Characterization of the Convex Hull of LowDimensional Quadratic Forms
18:30-19:00
Miguel Anjos
Solving Minimum k-Partition Problems Using Semidefinite Programming
19:00-19:30
Ismael de Farias
Branch-and-Cut for Separable Piecewise Linear Optimization


Thursday 10
Chair:Uwe Zimmermann
08:30-09:15
Robert Weismantel
Nonlinear Integer Programming
09:15-09:45
Monique Guignard
The Convex Hull Relaxation for Nonlinear Integer Programming Problems
09:45-10:15
Dennis Michaels
On the Computation of the Convex Envelope for a Nonlinear Function

Chair:Rainer Burkard
10:45-11:15
Thomas Magnanti
Minimizing with Concave Cost?
11:15-11:45
Jon Lee
Nonlinear Matroid Optimization and Extensions
11:45-12:15
Antoine Musitelli
Recognition of Binet Matrices

Chair:Bernhard Korte
17:15-18:00
Michel Balinski
The Majority Judgement
18:00-18:30
Andreas Schulz
Encouraging Cooperation in Sharing Supermodular Costs
18:30-19:00
Natashia Boland
Constrained Shortest Path Problems
19:00-19:30
Gyula Pap
Node-Capacitated Packing of A-paths

Chair:Michel Balinski, Robert Bixby, Rolf Möhring, and George Nemhauser
21:00-23:00
Let's discuss the future of our scientific community!


Friday 11
Chair:Rolf Möhring
08:30-09:15
Friedrich Eisenbrand
Integer Programming and Number Theory
09:15-09:45
Júlia Pap
Recognizing Conic TDI Systems is Hard
09:45-10:15
Johannes Hatzl
Combinatorial Properties of a Domination Problem with Parity Constraints

Chair:Jack Edmonds
10:45-11:15
Richard Karp
How Hard are the NP-hard Problems?
11:15-11:45
Peter Gritzmann
Optimal Wire Ordering and Spacing in Low Power Semiconductor Design
11:45-12:15
Marco Di Summa
Network Formulations of Mixed-Integer Programs

Chair:Denis Naddef
17:15-18:00
Andrea Lodi
Computation in Integer Programming
18:00-18:30
Tom McCormick
Strongly Polynomial Algorithms for Bi-Submodular Minimization
18:30-19:00
Michael Ritter
Optimal Flight Scheduling at Airports
19:00-19:30
Ulrich Pferschy
ILP-Based Algorithms for a Nurse Scheduling Problem