Cooke, Benjamin P.Kwon, DarongsaeGlotov, DmitrySchurr, SimonTaylor, DanielWittman, ToddShallcross, David F.(mentor)2007-08-162007-08-162002-07https://hdl.handle.net/11299/3798In the world of cellular telephony there is a hierarchy of controlling devices. Cellular telephones communicate with Base Transceiver Satations (BTS) or transceivers, which is turn are assigned to Base Station Controllers (BSC) or controllers. All controllers are connected to a Mobile Switching Centers (MSC). As a user of a cellular telephone moves around, the call must be transfered from transceiver to transceiver, and sometimes from controller to controller. We are interested in the problem of minimizing the cost of these transfers from controller to controller. In the above hierarchy, we consider a subtree emanating from one Mobile Switching Center. The two sets corresponding to the subtree are I, the set of transceivers, and J, the set of controllers. The problem is to assign each transceiver from the set I to a controller from the set J optimally subject to certain constraints...