A Heuristic for Prioritizing Flows on a Network

We present a heuristic for the following problem encountered in the design of certain telecommunication networks: given a set of multicommodity flows with preassigned priority values, and a network (of possibly inadequate capacity), find a routing that is best, lexicographically, in terms of priorities routed.