A branch-and-bound algorithm for the supply connected location-allocation problem on networks

Afrati, 1986, The complexity of the traveling repairmen problem, Theoret. Informatics Appl., 20, 79, 10.1051/ita/1986200100791 Fox, 1980, A n constraint formulation of the (time dependent) traveling salesman problem, Oper. Res., 28, 1018, 10.1287/opre.28.4.1018 Goemans, M., Kleinberg, J., 1996. An improved approximation ratio for the minimum latency problem. In: Proceedings of The Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Ch. 18 pp. 152–158 Hakimi, 1964, Optimum locations of switching centers and the absolute centers and medians of a graph, Operations Research, 12, 450, 10.1287/opre.12.3.450 Handler, G.Y., Mirchandani, P.B., 1979. Location in Networks: Theory and Algorithms. MIT Press, Cambridge, MA Love, R.F., Morris, J.G., Wesolowsky, G.O., 1988. Facilities Location: Models and Methods. North-Holland, New York Lucena, 1990, Time dependent traveling salesman problem – the delivery man case, Networks, 20, 753, 10.1002/net.3230200605 Mirchandani, P.B., 1990. The p-median problem and generalizations. In: Mirchandani, P.B., Francis, R.L. (Eds.), Discrete Location Theory. Wiley/Interscience, New York Mirchandani, P.B., Francis, R.L., 1990. Discrete Location Theory. Wiley, New York Minieka, E., 1989. The delivery man problem on a tree network. In: Louveaux, F.V., Labbe, M., Thisse, J.F. (Eds.), Facility Location Analysis: Theory and Applications, Annals of Operations Research, vol. 18, pp. 261–266 Picard, 1978, The time dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling, Oper. Res., 26, 86, 10.1287/opre.26.1.86 Rudin, W., 1976. Principles of Mathematical Analysis. McGraw-Hill, Singapore