These 33 revised papers from the International IPCO Conference held in June 1999 cover theoretical, computational and application-oriented aspects of approximation algorithms, branch and bound algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diaphantine equations, geometry of numbers, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling and semidefinite programs.