1. Ageev, A.A.: A polynomial-time algorithm for the facility location problem with uniform hard capacities on path graph. In: Proceedings of the 2nd International Workshop on Discrete Optimization Methods in Production and Logistics, DOM 2004, Omsk, pp. 28–32 (2004)
2. Ageev, A.A., Gimadi, E.Kh., Kurochkin, A.A.: A polynomial-time algorithm for the facility location problem on the path with uniform hard capacities. In: Discrete Analysis and Operation Research. IM SO RAN, Novosibirsk, vol. 16, no. 5, pp. 3–17 (2009)
3. Lecture Notes in Computer Science;FA Chudak,1999
4. Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119–171. Wiley, New York (1990)
5. Garey, M.R., Johnson, D.S.: Computers and Intractablity. Freeman, San Francisco (1979)