IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-01745324.html
   My bibliography  Save this paper

A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method

Author

Listed:
  • Jordi Castro
  • Stefano Nasini

    (LEM - Lille économie management - UMR 9221 - UA - Université d'Artois - UCL - Université catholique de Lille - Université de Lille - CNRS - Centre National de la Recherche Scientifique)

  • Francisco Saldanha-Da-Gama

Abstract

No abstract is available for this item.

Suggested Citation

  • Jordi Castro & Stefano Nasini & Francisco Saldanha-Da-Gama, 2017. "A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method," Post-Print hal-01745324, HAL.
  • Handle: RePEc:hal:journl:hal-01745324
    DOI: 10.1007/s10107-016-1067-6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Daniel Baena & Jordi Castro & Antonio Frangioni, 2020. "Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy," Management Science, INFORMS, vol. 66(7), pages 3051-3068, July.
    2. Saldanha-da-Gama, Francisco, 2022. "Facility Location in Logistics and Transportation: An enduring relationship," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    3. Laureano F. Escudero & María Araceli Garín & Celeste Pizarro & Aitziber Unzueta, 2018. "On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems," Computational Optimization and Applications, Springer, vol. 70(3), pages 865-888, July.
    4. Sai Ji & Gaidi Li & Dongmei Zhang & Xianzhao Zhang, 2023. "Approximation algorithms for the capacitated correlation clustering problem with penalties," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-16, January.
    5. Sauvey, Christophe & Melo, Teresa & Correia, Isabel, 2019. "Two-phase heuristics for a multi-period capacitated facility location problem with service-differentiated customers," Technical Reports on Logistics of the Saarland Business School 16, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    6. Nasini, Stefano & Nessah, Rabia, 2024. "Time-flexible min completion time variance in a single machine by quadratic programming," European Journal of Operational Research, Elsevier, vol. 312(2), pages 427-444.
    7. Di, Zhen & Yang, Lixing & Shi, Jungang & Zhou, Housheng & Yang, Kai & Gao, Ziyou, 2022. "Joint optimization of carriage arrangement and flow control in a metro-based underground logistics system," Transportation Research Part B: Methodological, Elsevier, vol. 159(C), pages 1-23.
    8. Ningxuan Kang & Hao Shen & Ye Xu, 2022. "JD.com Improves Delivery Networks by a Multiperiod Facility Location Model," Interfaces, INFORMS, vol. 52(2), pages 133-148, March.
    9. Corberán, Ángel & Landete, Mercedes & Peiró, Juanjo & Saldanha-da-Gama, Francisco, 2020. "The facility location problem with capacity transfers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    10. Kınay, Ömer Burak & Saldanha-da-Gama, Francisco & Kara, Bahar Y., 2019. "On multi-criteria chance-constrained capacitated single-source discrete facility location problems," Omega, Elsevier, vol. 83(C), pages 107-122.
    11. López-Ramos, Francisco & Nasini, Stefano & Sayed, Mohamed H., 2020. "An integrated planning model in centralized power systems," European Journal of Operational Research, Elsevier, vol. 287(1), pages 361-377.
    12. Nasini, Stefano & Nessah, Rabia, 2021. "An almost exact solution to the min completion time variance in a single machine," European Journal of Operational Research, Elsevier, vol. 294(2), pages 427-441.
    13. Castro, Jordi & Nasini, Stefano, 2021. "A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks," European Journal of Operational Research, Elsevier, vol. 290(3), pages 857-869.
    14. Pearce, Robin H. & Forbes, Michael, 2018. "Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 78-88.

    More about this item

    Statistics

    Access and download statistics

    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:hal:journl:hal-01745324. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.