Tuesday
Wednesday
The IPCO conferences, held every year in which no International
Symposium on Mathematical Programming takes place, are 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. 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-six papers
will be presented, in a series of 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.