PROGRAM
Monday 5
Chair:Maurice Queyranne
08:30-08:45
The Organizers
Welcome
08:45-09:15
Dorit Hochbaum
New efficient algorithms for the bipartite matching problem and the maximum closure problem
09:15-09:45
Adam Letchford
Computing good allocations for combinatorial optimization games
09:45:10:15
Marc Pfetsch
Line planning in public transport

Chair:Rolf Möhring
10:30-11:00
Akihisa Tamura
A General Two-Sided Matching Market with Discrete Concave Utility Functions
11:00-11:30
Stephan Krause
Blocking shortest paths by deleting minimum edge sets
11:30:12:00
Alberto Caprara
Bidimensional Packing by Bilinear Programming

Chair:Gerhard Reinelt
16:30-17:00
Agostinho Agra
Basic Knapsack Polyhedra and Extensions
17:00-17:30
Dirk Oliver Theis
A faster exact separation algorithm for blossom inequalities

Chair:Paolo Toth
17:45-18:15
Juan José Salazar González
Solving the Editing-and-Imputation Problem by Branch-and-Cut
18:15-18:45
Ivana Ljubić
A New Lower Bounding Procedure for the Prize-Collecting Steiner Tree Problem
18:45:19-15
Matteo Fischetti
A new refinement procedure for VRP

Tuesday 6
Chair:Leslie Trotter
08:30-09:00
Franz Rendl
Max-cut relaxations for large graphs
09:00-09:30
Klaus Wenger
Maximally violated mod-p cuts for the Capacitated Vehicle Routing Problem
09:30-10:00
Ted Ralphs
Decomposition and Dynamic Cut Generation in Integer Programming

Chair:Jean Fonlupt
10:30-11:00
Francisco Barahona
Fractional Packing of T-joins
11:00-11:30
Gianpaolo Oriolo
Domination Between Traffic Matrices
11:30:12:00
Ekkehard Köhler
Approximating earliest arrival flows with flow-dependent transit times

Chair:Michael Jünger
16:30-17:00
Agnes Dittel
Integer Programming and Protein Folding
17:00-17:30
Jon Lee
Parsimonious Binary-Encoding

Chair:Dominique de Werra
17:45-18:15
Michel Goemans
Approximate König's Theorem for Edge Coloring Weighted Bipartite Graphs
18:15-18:45
Andrea Lodi
The feasibility pump
18:45:19-15
Ruslan Sadykov
Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem with Deadlines and Release

Wednesday 7
Chair:Martine Labbé
08:30-09:00
Edoardo Amaldi
On minimum cycle bases in graphs
09:00-09:30
Ulrich Brenner
An Efficient Algorithm for Mininum-Cost Flow Problems on Large Unbalanced Bipartite Graphs
09:30-10:00
Stan van Hoesel
Tariff setting in multicommodity networks

Chair:Jean François Maurras
10:30-11:00
Kathie Cameron
Pivoting to find a second degree- constrained spanning tree
11:00-11:30
Gautier Stauffer
Clique-circulants and the Stable Set Polytope of Quasi-line Graphs
11:30:12:00
Guillermo Durán
On balanced graphs

Chair:Thomas McCormick
16:30-17:00
Annegret Wagler
The Normal Graph Conjecture for Circulant Graphs
17:00-17:30
Andreas Schulz
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem

Chair:Giovanni Rinaldi
17:45-18:15
Dimitris Bertsimas
Robust Discrete Optimization
18:15-18:45
Stephan Thomasse
Three new min/max theorems in directed graphs
18:45:19-15
András Sebö
Bessy-Thomassé polyhedra: algorithms, variants, questions, ...,

Thursday 8
Chair:Yves Pochet
08:30-09:00
Robert Weismantel
Optimality criterion for a class of nonlinear integer programs
09:00-09:30
Denis Cornaz
Complete Disjoint Subgraphs and Complete Multipartite Subgraph
09:30-10:00
Eric Tannier
Sorting signed permutations by reversals in subquadratic time.

Chair:Alexander Martin
10:30-11:00
Jean-Paul Doignon
The approval-voting polytope
11:00-11:30
Diego Klabjan
Mixed Integer Programming with Variable Upper Bounds
11:30:12:00
Olivier Briant
Comparison of various approaches of column generatiion

Chair:Uwe Zimmermann
16:30-17:00
Quentin Louveaux
Extended formulations for Gomory Corner Polyhedra
17:00-17:30
Martin Skutella
An online FPTAS for minimizing the makespan on identical parallel machines with bounded job migration

Chair:Ridha Mahjoub
17:45-18:15
Dirk Müller
Fast flow augmentation in bit-pattern-represented grid graphs
18:15-18:45
Marco Lübbecke
Rectangle Covers Revisited Computationally

Friday 9
Chair:François Margot
08:15-08:45
Jens Vygen
Legalizing a placement with minimum total movement
08:45-09:15
Roland Wessäly
The DFG-Research Center: optimizing core and access telecommunication networks
09:15-09:45
Jean-François Macq
Trade-offs on the Location of the Core Node in a Network

Chair:Jack Edmonds
10:00-10:30
Michele Conforti
Solving stable set problems by decomposition
10:30-11:00
Andrew Miller
Multi-Supplier Procurement: Dual LP Separation and Economic Equilibria
11:00-11:30
Hipólito Hernández Pérez
New Inequalities for the one-commodity Pickup-and-Delivery Travelling Salesman Problem