How to cite this paper
Alamatsaz, K., Jolfaei, A & Iranpoor, M. (2020). Edge covering with continuous location along the network.International Journal of Industrial Engineering Computations , 11(4), 627-642.
Refrences
Berman, O., Kalcsics, J., Krass, D.J.C. & Research, O. (2016). On covering location problems on networks with edge demand. Computers & Operations Research, 74, 214-227.
Bertsimas, D. & Tsitsiklis, J.N. (1997). Introduction to linear optimization (Vol. 6): Athena Scientific Belmont, MA.
Bramel, J. & Simchi-Levi, D. (1997). The logic of logistics: theory, algorithms, and applications for logistics management (pp. 175-240). New York: Springer.
Cai, S., Li, Y., Hou, W. & Wang, H.J.I.S. (2019). Towards faster local search for minimum weight vertex cover on massive graphs. Information Sciences, 471, 64-79.
Camm, J.D., Raturi, A.S. & Tsubakitani, S.J.I. (1990). Cutting big M down to size. Interfaces, 20(5), 61-66.
Church, R.L. & Meadows, M.E.J.G.A. (1979). Location modeling utilizing maximum service distance criteria. Geographical Analysis , 11(4), 358-373.
Church, R.L. & Murray, A.J.A.i.S.S. (2018). Location Covering Models. Advances in Spatial Science.
Conrow, L., Murray, A.T. & Fischer, H.A.J.J.o.t.g. (2018). An optimization approach for equitable bicycle share station siting. Journal of Transport Geography, 69, 163-170.
Cormen, T.H., Leiserson, C.E., Rivest, R.L. & Stein, C. (2009). Introduction to algorithms: MIT press.
Daskin, M.S. (2011). Network and discrete location: models, algorithms, and applications. John Wiley & Sons.
De Los Mozos, M.C.L. & Mesa, J.A.J.R.-O.R. (2000). The variance location problem on a network with continuously distributed demand. RAIRO-Operations Research, 34(2), 155-182.
Farahani, R.Z., Asgari, N., Heidari, N., Hosseininia, M., Goh, M.J.C. & Engineering, I. (2012). Covering problems in facility location: A review. Computers & Industrial Engineering, 62(1), 368-407.
Groß, D.R.P., Hamacher, H.W., Horn, S. & Schöbel, A.J.T. (2009). Stop location design in public transportation networks: covering and accessibility objectives. Top, 17(2), 335.
Hakimi, S.L.J.O.r. (1965). Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research, 13(3), 462-475.
Heragu, S.S. (2008). Facilities design: Crc Press.
Jayalakshmi, B., Singh, A.J.I.J.o.M.L. & Cybernetics. (2017). A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem. International Journal of Machine Learning and Cybernetics, 8(2), 691-697.
Laporte, G., Nickel, S. & da Gama, F.S. (2015). Location science (Vol. 528): Springer.
Li, R., Hu, S., Zhang, H. & Yin, M.J.I.S. (2016). An efficient local search framework for the minimum weighted vertex cover problem. Information Sciences, 372, 428-445.
Oğuz, M., Bektaş, T. & Bennell, J.A.J.E.J.o.O.R. (2018). Multicommodity flows and Benders decomposition for restricted continuous location problems. European Journal of Operational Research, 266(3), 851-863.
Pandey, P. & Punnen, A.P.J.D.O. (2018). The generalized vertex cover problem and some variations. Discrete Optimization, 30, 121-143.
ReVelle, C., Toregas, C. & Falkson, L.J.G.a. (1976). Applications of the location set‐covering problem. Geographical Analysis, 8(1), 65-76.
Sadigh, A.N., Mozafari, M. & Kashan, A.H.J.A.i.E.S. (2010). A mixed integer linear program and tabu search approach for the complementary edge covering problem. Advances in Engineering Software, 41(5), 762-768.
Schobel, A., Hamacher, H.W., Liebers, A. & Wagner, D.J.A.-P.J.o.O.R. (2009). The continuous stop location problem in public transportation networks. Asia-Pacific Journal of Operational Research, 26(01), 13-30.
Snyder, L.V. (2011). Covering problems. In Foundations of location analysis (pp. 109-135). Springer, Boston, MA.
Taşkin, Z. C. (2010). Benders decomposition. Wiley Encyclopedia of Operations Research and Management Science.
Toregas, C., Swain, R., ReVelle, C., & Bergman, L. (1971). The location of emergency service facilities. Operations research, 19(6), 1363-1373.
Wei, R., Murray, A. T., & Batta, R. (2014). A bounding-based solution approach for the continuous arc covering problem. Journal of Geographical Systems, 16(2), 161-182.
Bertsimas, D. & Tsitsiklis, J.N. (1997). Introduction to linear optimization (Vol. 6): Athena Scientific Belmont, MA.
Bramel, J. & Simchi-Levi, D. (1997). The logic of logistics: theory, algorithms, and applications for logistics management (pp. 175-240). New York: Springer.
Cai, S., Li, Y., Hou, W. & Wang, H.J.I.S. (2019). Towards faster local search for minimum weight vertex cover on massive graphs. Information Sciences, 471, 64-79.
Camm, J.D., Raturi, A.S. & Tsubakitani, S.J.I. (1990). Cutting big M down to size. Interfaces, 20(5), 61-66.
Church, R.L. & Meadows, M.E.J.G.A. (1979). Location modeling utilizing maximum service distance criteria. Geographical Analysis , 11(4), 358-373.
Church, R.L. & Murray, A.J.A.i.S.S. (2018). Location Covering Models. Advances in Spatial Science.
Conrow, L., Murray, A.T. & Fischer, H.A.J.J.o.t.g. (2018). An optimization approach for equitable bicycle share station siting. Journal of Transport Geography, 69, 163-170.
Cormen, T.H., Leiserson, C.E., Rivest, R.L. & Stein, C. (2009). Introduction to algorithms: MIT press.
Daskin, M.S. (2011). Network and discrete location: models, algorithms, and applications. John Wiley & Sons.
De Los Mozos, M.C.L. & Mesa, J.A.J.R.-O.R. (2000). The variance location problem on a network with continuously distributed demand. RAIRO-Operations Research, 34(2), 155-182.
Farahani, R.Z., Asgari, N., Heidari, N., Hosseininia, M., Goh, M.J.C. & Engineering, I. (2012). Covering problems in facility location: A review. Computers & Industrial Engineering, 62(1), 368-407.
Groß, D.R.P., Hamacher, H.W., Horn, S. & Schöbel, A.J.T. (2009). Stop location design in public transportation networks: covering and accessibility objectives. Top, 17(2), 335.
Hakimi, S.L.J.O.r. (1965). Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research, 13(3), 462-475.
Heragu, S.S. (2008). Facilities design: Crc Press.
Jayalakshmi, B., Singh, A.J.I.J.o.M.L. & Cybernetics. (2017). A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem. International Journal of Machine Learning and Cybernetics, 8(2), 691-697.
Laporte, G., Nickel, S. & da Gama, F.S. (2015). Location science (Vol. 528): Springer.
Li, R., Hu, S., Zhang, H. & Yin, M.J.I.S. (2016). An efficient local search framework for the minimum weighted vertex cover problem. Information Sciences, 372, 428-445.
Oğuz, M., Bektaş, T. & Bennell, J.A.J.E.J.o.O.R. (2018). Multicommodity flows and Benders decomposition for restricted continuous location problems. European Journal of Operational Research, 266(3), 851-863.
Pandey, P. & Punnen, A.P.J.D.O. (2018). The generalized vertex cover problem and some variations. Discrete Optimization, 30, 121-143.
ReVelle, C., Toregas, C. & Falkson, L.J.G.a. (1976). Applications of the location set‐covering problem. Geographical Analysis, 8(1), 65-76.
Sadigh, A.N., Mozafari, M. & Kashan, A.H.J.A.i.E.S. (2010). A mixed integer linear program and tabu search approach for the complementary edge covering problem. Advances in Engineering Software, 41(5), 762-768.
Schobel, A., Hamacher, H.W., Liebers, A. & Wagner, D.J.A.-P.J.o.O.R. (2009). The continuous stop location problem in public transportation networks. Asia-Pacific Journal of Operational Research, 26(01), 13-30.
Snyder, L.V. (2011). Covering problems. In Foundations of location analysis (pp. 109-135). Springer, Boston, MA.
Taşkin, Z. C. (2010). Benders decomposition. Wiley Encyclopedia of Operations Research and Management Science.
Toregas, C., Swain, R., ReVelle, C., & Bergman, L. (1971). The location of emergency service facilities. Operations research, 19(6), 1363-1373.
Wei, R., Murray, A. T., & Batta, R. (2014). A bounding-based solution approach for the continuous arc covering problem. Journal of Geographical Systems, 16(2), 161-182.