Thursday
Friday
This meeting, the eighth in the series of IPCO (Integer Programming and Combinatorial Optimization) conferences held every year in which no
MPS International 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 programs