An integer packing problem is an integer program of the form: max c^Tx subject to Ax <= b, x is integer and the entries of A,b,c are non-negative. In the online version of this problem, the columns of A arrive online. When the j^{th} column arrives we set the variable x_j and this cannot be modified subsequently.

This model captures online virtual circuit routing, load balancing etc. In this talk I will present an algorithm for this problem.