|
Aussois 2002
6th International Workshop in Combinatorial Optimization
|
Organizers :
Tom Liebling (homepage),
Denis Naddef (homepage),
Laurence Wolsey (homepage)
Click here to see the list of
participants (with photos) !
Program
Monday, January 7, 2002
Morning session
Chair : Leslie Trotter
-
08:45 Rolf Möhring, Berlin : Routing traffic flows in networks
with congestion
-
09:15 Satoru Fujishige, Osaka : A modified IFF algorithm for
submodular function minimization with multiple exchanges
-
9:45 Eduardo Uchoa Barboza, Rio de Janeiro : Recent advances in
practical solution of the Steiner problem in graphs
Chair : Michele Conforti
-
10:30 S. Thomas McCormick, Vancouver : The complexity of Max Flow and
Min Cut with bounded length path
-
11:00 Annegret Wagler, Berlin : How imperfect are certain graphs
after deleting critical edges ?
-
11:30 Matteo Fischetti, Padova : Local branching, or how to enhance
the heuristic behavior of your favorite 0-1 MIP solver
Afternoon Session
Chair : Günter Rote
-
17:30 Jorge Ramirez Alfonsin, Paris : About the Frobenius problem
-
18:00 Gerhard Woeginger, Twente : A problem in DNA sequencing
-
18:30 Adam Letchford, Lancaster : Polynomial-time separation of simple
comb inequalities
-
19:00 Hande Yaman, Bruxelles : Solving the single assignment hub
location problem
Tuesday, January 8, 2002
Morning Session
Chair : Michel Goemans
-
08:45 Adrian Zymolka, Berlin : Stable multi-sets
-
09:15 András Sebö, Grenoble : Optimal cooperation, Potts
partition function and graphic submodularity
-
09:45 Matthias Müller-Hannemann, Bonn : How to find the best
train connection? (Large scale Pareto shortest paths in real time)
Chair : Maurice Queyranne
-
10:45 David Williamson, Almaden : Approximation algorithms for Max
3-CUT and other problems using complex semidefinite problems
-
11:15 Frauke Liers, Köln : Ising spin glasses and the Max-Cut
problem in grid graphs
-
11:45 Miguel Anjos, Köln : Properties of a new SDP relaxation for the
Max-Cut problem
Afternoon Session
Chair : Jean Fonlupt
-
16:00 Egon Balas, Pittsburg : On certain unions of polyhedra
-
16:30 Jens Vygen, Bonn : Theory of static timing analysis of VLSI
chips
-
17:00 Stephan Held, Bonn : Potential balance algorithm and
applications in VLSI design
Chair : Paolo Toth
-
18:00 Pierre Fouilhoux, Clermont-Ferrand : Via minimization and the
bipartite induced subgraph problem
-
18:30 Juan Jose Salazar, Tenerife : The generalized subgraph
problem
-
19:00 René Weisskircher, Wien : Bend minimization in graph
drawing using ILP
Wednesday, January 9, 2002
Late Afternoon Session
Chair : Jean-François Maurras
-
18:00 Michael Perregaard, Pittsburg : Finding a sufficient set of
facets for a disjunctive program
-
18:30 Brady Hunsaker, Atlanta : Measuring cutting plane
effectiveness
-
19:00 Gianpaolo Oriolo, Roma : Frequency assignment by vertex packing
on K-thin graphs
Thursday, January 10, 2002
Morning Session
Chair: Giovanni Rinaldi
-
08:45 Bram Verweij, Louvain-la-Neuve : The sample average
approximation method applied to routing problems
-
09:15 André Rohe , Bonn : Parallel algorithms for local
routing
-
09:45 Arie Koster, Berlin : Load-balancing in signaling transfer
points
Chair : Gerhard Reinelt
-
10:45 Mathieu Van Vyve, Louvain-la-Neuve : Using extended formulations
to solve lot-sizing problems
-
11:15 Ekkerhard Köhler, Berlin : Flows over time with load-dependent
transit times
-
11:45 Vanessa Kääb, Zürich : Critical sets in
AND/OR-networks
Afternoon Session
Chair : Petra Mutzel
-
17:30 Kathy Cameron, Waterloo : Induced matchings and connected
matchings
-
18:00 Stephan Tiedemann, Duisburg : Probability functionals and risk
aversion in stochastic integer programming
-
18:30 Chistoph Buchheim, Köln : Detecting symmetries by branch
and cut
-
19:00 Klaus Wenger, Heidelberg : A new approach to constructing cactus
representations of Min-Cuts
Friday, January 11, 2002
Morning Session
Chair : Alexander Martin
-
08:45 Nicolas Stier Moses, Cambridge : Efficiency of user equilibria
in traffic networks
-
09:15 Alberto Caprara, Bologna : Models and algorithms for staff
scheduling problems
-
09:45 Sándor Fekete, Braunschweig : The freeze-tag problem: how
to wake up a swarm of robots
Chair: Jack Edmonds
-
10:45 Andrea Lodi, Bologna : Primal separation algorithms
-
11:15 Andreas Schulz, Cambridge : Combinatorial auctions