Atlas home || Conferences | Abstracts | about Atlas
Host: Massachusetts Institute of Technology
Sponsor: Mathematical Programming Society
Homepage: http://mit.edu/ipco2002/
Email: ipco2002@mit.edu
Organizers: Andreas S. Schulz (chair)
Deadline for abstracts: October 29, 2001
Description:
This meeting, the ninth in the series of IPCO (Integer Programming and
Combinatorial Optimization) conferences held every year in which no MPS
Symposium 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-six 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.
Mail Address:
Andreas S. Schulz IPCO 2002 Massachusetts Institute of Technology E53-361 77 Massachusetts Avenue Cambridge, MA 02139-4307 USA
Submitted by: Andreas S. Schulz
Date received: August 07, 2001
© 2008 Atlas Conferences Inc.