[CPCP] Suggested References

  2. Albareda-Sambola M, Dķaz J, Fernįndez E (2010) Lagrangean duals and exact solution to the capacitated p-center problem. European Journal of Operational Research 201(1):71–81. Available at https://doi.org/10.1016/j.ejor.2009.02.022.
  4. Calik H, Tansel B (2013) Double bound method for solving the p-center location problem. Computers & Operations Research 40(12):2991–2999. Available at https://doi.org/10.1016/j.cor.2013.07.011.
  6. Ceselli A, Righini G (2005) A branch-and-price algorithm for the capacitated p-median problem. Networks 45(3):125–142. Available at https://doi.org/10.1002/net.20059.
  8. Elloumi S, Labbé M, Pochet Y (2004) A new formulation and resolution method for the p-center problem. INFORMS Journal on Computing 16(1):84–94. Available at https://doi.org/10.1287/ijoc.1030.0028.
  10. Lorena L, Senne E (2004) A column generation approach to capacitated p-median problems. Computers & Operations Research 31(6):863–876. Available at https://doi.org/10.1016/S0305-0548(03)00039-X.
  12. Özsoy F, Pınar M (2006) An exact algorithm for the capacitated vertex p-center problem. Computers & Operations Research 33(5):1420–1436. Available at https://doi.org/10.1016/j.cor.2004.09.035.
  14. Quevedo-Orozco D, Rķos-Mercado R (2015) Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent. Computers & Operations Research 62:133–144. Available at https://doi.org/10.1016/j.cor.2014.12.013.
  16. Scaparra M, Pallottino S, Scutellą M (2004) Large-scale local search heuristics for the capacitated vertex p-center problem. Networks 43(4):241–255. Available at https://doi.org/10.1002/net.20000.