5. IPCO 1996: Vancouver, BC, Canada

Session 1: Integer Programming Theory

Session 2: Integer Programming Models

Session 3: Network Flow Algorithms

Session 4: Approximation Algorithms

Session 5: Semi-Definite Methods

Session 6: Matrix Models

Session 7: Set Systems and Submodularity

Session 8: Scheduling I

Session 9: Probabilistic Methods

Session 10: Scheduling II

Session 11: Polyhedral Methods

Session 12: The Travelling Salesman Problem

maintained by Schloss Dagstuhl LZI, founded at University of Trier