An optimal solution to the "Philadelphia" channel assignment problem

The Philadelphia problem is often used as a test problem in channel assignment research. Given a cellular network, the demand in each cell, and a number of interference constraints, the question is to determine the minimum span (number of consecutive channels) of any valid channel assignment. We present a solution to this problem by giving a theoretically obtained lower bound and a matching optimal assignment.