About the Conference

This meeting, the ninth in the series of IPCO (Integer Programming and Combinatorial Optimization) conferences held every year in which no International Symposium on Mathematical Programming takes place, is 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 of integer programming and combinatorial optimization.

Topics include, but are not limited to:

approximation algorithms
branch and bound 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
polyhedral combinatorics
scheduling theory and algorithms
semidefinite programming

In all these areas, IPCO welcomes structural and algorithmic results, revealing computational studies, and novel applications of these techniques to practical problems. The algorithms studied may be sequential or parallel, deterministic or randomized. During the three days, approximately thirty-three papers will be presented, in a series of sequential (non-parallel) sessions. Each lecture will be thirty minutes long.

The conference proceedings will contain full texts of all presented papers. Copies will be provided to all participants at registration time.

Follow one of these links for further information on IPCO conferences:

Back to the IPCO 2002 Conference home page.

Comments and questions to ipco2002@mit.edu. Page maintained by Nicolas Stier. Last updated Tue May 28 00:13:08 EDT 2002.