IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v201y2010i1p71-81.html
   My bibliography  Save this article

Lagrangean duals and exact solution to the capacitated p-center problem

Author

Listed:
  • Albareda-Sambola, Maria
  • Díaz, Juan A.
  • Fernández, Elena

Abstract

In this work, we address the capacitated p-center problem (CpCP). We study two auxiliary problems, discuss their relation to CpCP, and analyze the lower bounds obtained with two different Lagrangean duals based on each of these auxiliary problems. We also compare two different strategies for solving exactly CpCP, based on binary search and sequential search, respectively. Various data sets from the literature have been used for evaluating the performance of the proposed algorithms.

Suggested Citation

  • Albareda-Sambola, Maria & Díaz, Juan A. & Fernández, Elena, 2010. "Lagrangean duals and exact solution to the capacitated p-center problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 71-81, February.
    • Handle: RePEc:eee:ejores:v:201:y:2010:i:1:p:71-81
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00071-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fleszar, K. & Hindi, K.S., 2008. "An effective VNS for the capacitated p-median problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 612-622, December.
    2. Scheuerer, Stephan & Wendolsky, Rolf, 2006. "A scatter search heuristic for the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 533-547, March.
    3. Sourour Elloumi & Martine Labbé & Yves Pochet, 2004. "A New Formulation and Resolution Method for the p-Center Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 84-94, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Raphael Kramer & Manuel Iori & Thibaut Vidal, 2020. "Mathematical Models and Search Algorithms for the Capacitated p -Center Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 444-460, April.
    2. Hinojosa, Yolanda & Marín, Alfredo & Puerto, Justo, 2023. "Dynamically second-preferred p-center problem," European Journal of Operational Research, Elsevier, vol. 307(1), pages 33-47.
    3. Lu, Chung-Cheng, 2013. "Robust weighted vertex p-center model considering uncertain data: An application to emergency management," European Journal of Operational Research, Elsevier, vol. 230(1), pages 113-121.
    4. José Alejandro Cornejo Acosta & Jesús García Díaz & Ricardo Menchaca-Méndez & Rolando Menchaca-Méndez, 2020. "Solving the Capacitated Vertex K-Center Problem through the Minimum Capacitated Dominating Set Problem," Mathematics, MDPI, vol. 8(9), pages 1-16, September.
    5. Espejo, Inmaculada & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2015. "Capacitated p-center problem with failure foresight," European Journal of Operational Research, Elsevier, vol. 247(1), pages 229-244.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Juan A. Díaz & Dolores E. Luna, 2017. "Primal and dual bounds for the vertex p-median problem with balance constraints," Annals of Operations Research, Springer, vol. 258(2), pages 613-638, November.
    2. Mai, Feng & Fry, Michael J. & Ohlmann, Jeffrey W., 2018. "Model-based capacitated clustering with posterior regularization," European Journal of Operational Research, Elsevier, vol. 271(2), pages 594-605.
    3. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    4. Noureddine Bouhmala, 2019. "Combining simulated annealing with local search heuristic for MAX-SAT," Journal of Heuristics, Springer, vol. 25(1), pages 47-69, February.
    5. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    6. Zhen, Lu & Gao, Jiajing & Tan, Zheyi & Laporte, Gilbert & Baldacci, Roberto, 2023. "Territorial design for customers with demand frequency," European Journal of Operational Research, Elsevier, vol. 309(1), pages 82-101.
    7. Hinojosa, Yolanda & Marín, Alfredo & Puerto, Justo, 2023. "Dynamically second-preferred p-center problem," European Journal of Operational Research, Elsevier, vol. 307(1), pages 33-47.
    8. Medal, Hugh R. & Pohl, Edward A. & Rossetti, Manuel D., 2014. "A multi-objective integrated facility location-hardening model: Analyzing the pre- and post-disruption tradeoff," European Journal of Operational Research, Elsevier, vol. 237(1), pages 257-270.
    9. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    10. Benati, Stefano & García, Sergio, 2012. "A p-median problem with distance selection," DES - Working Papers. Statistics and Econometrics. WS ws121913, Universidad Carlos III de Madrid. Departamento de Estadística.
    11. Fleszar, K. & Hindi, K.S., 2008. "An effective VNS for the capacitated p-median problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 612-622, December.
    12. Nicolas Dupin & Frank Nielsen & El-Ghazali Talbi, 2021. "Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front," Mathematics, MDPI, vol. 9(4), pages 1-30, February.
    13. Callaghan, Becky & Salhi, Said & Nagy, Gábor, 2017. "Speeding up the optimal method of Drezner for the p-centre problem in the plane," European Journal of Operational Research, Elsevier, vol. 257(3), pages 722-734.
    14. Enrique Domínguez & Alfredo Marín, 2020. "Discrete ordered median problem with induced order," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 793-813, October.
    15. Nickel, Stefan & Velten, Sebastian, 2017. "Optimization problems with flexible objectives: A general modeling approach and applications," European Journal of Operational Research, Elsevier, vol. 258(1), pages 79-88.
    16. Anton-Sanchez, Laura & Landete, Mercedes & Saldanha-da-Gama, Francisco, 2023. "The discrete p-center location problem with upgrading," Omega, Elsevier, vol. 119(C).
    17. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    18. Jaroslav Janáček & Marek Kvet & Peter Czimmermann, 2023. "Kit of Uniformly Deployed Sets for p -Location Problems," Mathematics, MDPI, vol. 11(11), pages 1-14, May.
    19. Fernández, Elena & Kalcsics, Jörg & Nickel, Stefan, 2013. "The maximum dispersion problem," Omega, Elsevier, vol. 41(4), pages 721-730.
    20. Raka Jovanovic & Abdelkader Bousselham & Stefan Voß, 2015. "A heuristic method for solving the problem of partitioning graphs with supply and demand," Annals of Operations Research, Springer, vol. 235(1), pages 371-393, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:201:y:2010:i:1:p:71-81. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.