@article {1491, title = {A location problem on unicyclic networks: Balanced case}, journal = {European Journal of Operational Research}, volume = {62}, year = {1992}, pages = {194-202}, abstract = {

The problem of locating n stations on a unicyclic unidirectional network is considered. We formulated the problem as an integer program for the case of a balanced flow matrix, i.e., the total inflow to a station equals the total outflow from that station. The integer programming formulation reduces the problem to a station sequencing problem regardless of the actual station locations on the network. Furthermore, the empirical evidence suggests that the LP solutions to the relaxed IP formulations are optimal.

}, issn = {0377-2217}, doi = {https://doi.org/10.1016/0377-2217(92)90247-7}, url = {https://www.sciencedirect.com/science/article/pii/0377221792902477}, author = {Ali S. Kiran and Ali Tamer {\"U}nal and Selcuk Karabati} }