Announcement and Call for Papers for the

  Eleventh Conference on Integer Programming and Combinatorial Optimization 

                            IPCO XI
 
                        June 8-10, 2005

                Technische Universitaet Berlin
                 DFG Research Center MATHEON

Important dates:
  
  Abstract submission: Nov 15, 2004
  Notification:        Jan 31, 2005

For more details, see:

              http://www.math.tu-berlin.de/ipco05

In conjunction with the conference, there will be a summer school on

      'Randomized Methods in Combinatorics and Optimization'

                        June 6-7, 2005
                           TU Berlin

The IPCO conference is held every year, except for those years in which 
the 'Symposium on Mathematical Programming' takes place. The conference
is meant to be a forum for researchers and practitioners working on various 
aspects of integer programming and combinatorial optimization. The aim is 
to present recent developments in theory, computation, and applications in 
that area. The scope of IPCO is viewed in a broad sense, to include 
algorithmic and structural results in topics such as:

- approximation algorithms
- branch and bound algorithms
- branch and cut algorithms
- computational biology
- computational complexity
- computational geometry
- cutting plane algorithms
- diophantine equations
- geometry of numbers
- graph and network algorithms
- integer programming
- matroids and submodular functions
- on-line algorithms and competitive analysis
- polyhedral combinatorics
- randomized algorithms
- random graphs
- scheduling theory and scheduling algorithms
- semidefinite programs

IPCO is not restricted to theory. Computational and practical work, 
implementations, novel applications of these techniques to practical 
problems, and revealing computational studies, are most welcome.

During the conference, approximately 30-35 papers will be presented in 
a series of non-parallel sessions. Each lecture will be 30 minutes long.
The program committee will select the papers to be presented on the
basis of extended abstracts to be submitted as described at the conference 
WWW-page (see above). 

The proceedings will be published as Springer Lecture Notes in
Computer Science. They will contain full texts of all presented
papers. Each participant will receive a copy at the conference.

Program Committee:

- Michele Conforti (U Padova)
- Jesus De Loera (UC Davis)
- Andras Frank (ELTE Budapest)
- Dorit Hochbaum (UC Berkeley)
- Michael Juenger, CHAIR (U Koeln)
- Volker Kaibel (TU Berlin)
- Adam Letchford (Lancaster U)
- Rolf Moehring (TU Berlin)
- Petra Mutzel (TU Wien)
- Maurice Queyranne (U British Columbia)
- Franz Rendl (U Klagenfurt)
- Bruce Shepherd (Bell Labs)

At the summer school, three leading experts will give lectures on current
developments in the area of randomized methods in Combinatorics and 
Optimization. The details of the program will be available soon at the
conference WWW-page (see above). 
 
For further information, please contact:

ipco05@math.tu-berlin.de

Volker Kaibel

Instuitut fuer Mathematik, MA 6-2
TU Berlin
Strasse des 17. Juni 136
10623 Berlin
Germany