An integer programming approach to packing lightpaths on WDM networks

We consider a routing and wavelength assignment (RWA) for the efficient operation of WDM networks. For a given physical network, a set of selected pairs of nodes, the number of required connections for each selected pair of nodes, and a set of available wavelengths, the RWA is to realize as many connections as possible without wavelength collision. We give an integer programming formulation and an algorithm based on column generation. Though the proposed algorithm does not guarantee optimal solutions, test results show that the algorithm gives probably good solutions.