A location problem on unicyclic networks: Balanced case
Başlık | A location problem on unicyclic networks: Balanced case |
Publication Type | Journal Article |
Year of Publication | 1992 |
Authors | Kiran, A. S., A. Tamer Ünal, and S. Karabati |
Journal | European Journal of Operational Research |
Volume | 62 |
Pagination | 194-202 |
ISSN | 0377-2217 |
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. |
URL | https://www.sciencedirect.com/science/article/pii/0377221792902477 |
DOI | 10.1016/0377-2217(92)90247-7 |