IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v347y2025i3d10.1007_s10479-025-06536-5.html
   My bibliography  Save this article

On $$\lambda $$ λ -cent-dians and generalized-center for network design: definitions and properties

Author

Listed:
  • Víctor Bucarey

    (Universidad de O’Higgins
    Instituto Sistemas Complejos de Ingeniería (ISCI))

  • Natividad González-Blanco

    (Universidad Loyola Andalucía)

  • Martine Labbé

    (Université Libre de Bruxelles
    Inria Lille-Nord Europe)

  • Juan A. Mesa

    (Universidad de Sevilla
    Universidad de Sevilla)

Abstract

In this paper, we extend the notions of $$\lambda $$ λ -cent-dian and generalized-center from Facility Location Theory to the more intricate domain of Network Design. Our focus is on the task of designing a sub-network within a given underlying network while adhering to a budget constraint. This sub-network is intended to efficiently serve a collection of origin/destination pairs of demand. The $$\lambda $$ λ -cent-dian problem studies the balance between efficiency and equity. We investigate the properties of the $$\lambda $$ λ -cent-dian and generalized-center solution networks under the lens of equity, efficiency, and Pareto-optimality. We finally prove that the problems solved here are NP-hard.

Suggested Citation

  • Víctor Bucarey & Natividad González-Blanco & Martine Labbé & Juan A. Mesa, 2025. "On $$\lambda $$ λ -cent-dians and generalized-center for network design: definitions and properties," Annals of Operations Research, Springer, vol. 347(3), pages 1193-1211, April.
    • Handle: RePEc:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-025-06536-5
    DOI: 10.1007/s10479-025-06536-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06536-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-025-06536-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Anthony Przybylski & Xavier Gandibleux & Matthias Ehrgott, 2010. "A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 371-386, August.
    2. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    3. Jonathan Halpern, 1978. "Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph," Management Science, INFORMS, vol. 24(5), pages 535-544, January.
    Full references (including those not matched with items on IDEAS)

    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. Víctor Bucarey & Natividad González-Blanco & Martine Labbé & Juan A. Mesa, 2025. "On $$\lambda $$ λ -cent-dians and generalized-center for network design: formulations and algorithms," Annals of Operations Research, Springer, vol. 349(3), pages 1553-1573, June.
    2. Justo Puerto & Federica Ricca & Andrea Scozzari, 2018. "Extensive facility location problems on networks: an updated review," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 187-226, July.
    3. Becker, Ronald I. & Lari, Isabella & Scozzari, Andrea, 2007. "Algorithms for central-median paths with bounded length on trees," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1208-1220, June.
    4. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    5. Zheng, Handong & Ye, Xin & Chen, Rongsheng & Chen, Yi, 2025. "Resilient high-end equipment manufacturing supply chain design with irreplaceable suppliers: An IFTOPSIS-MOMIP hybrid model," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
    6. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    7. Soudabeh Seyyedi Ghomi & Fahimeh Baroughi, 2024. "Robust vertex centdian facility location problem on tree networks," Annals of Operations Research, Springer, vol. 341(2), pages 1135-1149, October.
    8. Jamain, Florian, 2014. "Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14002 edited by Bazgan, Cristina.
    9. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.
    10. Lari, Isabella & Ricca, Federica & Scozzari, Andrea, 2008. "Comparing different metaheuristic approaches for the median path problem with bounded length," European Journal of Operational Research, Elsevier, vol. 190(3), pages 587-597, November.
    11. Mark Rozanov & Arie Tamir, 2018. "The nestedness property of location problems on the line," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 257-282, July.
    12. Melih Ozlen & Benjamin A. Burton & Cameron A. G. MacRae, 2014. "Multi-Objective Integer Programming: An Improved Recursive Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 470-482, February.
    13. Laporte, G. & Mesa, J.A. & Ortega, F.A. & Perea, F., 2011. "Planning rapid transit networks," Socio-Economic Planning Sciences, Elsevier, vol. 45(3), pages 95-104, September.
    14. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    15. Marie Schmidt & Anita Schöbel, 2014. "Location of speed-up subnetworks," Annals of Operations Research, Springer, vol. 223(1), pages 379-401, December.
    16. Pablo A. Miranda-Gonzalez & Javier Maturana-Ross & Carola A. Blazquez & Guillermo Cabrera-Guerrero, 2021. "Exact Formulation and Analysis for the Bi-Objective Insular Traveling Salesman Problem," Mathematics, MDPI, vol. 9(21), pages 1-33, October.
    17. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    18. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    19. M. Turkensteen (Marcel) & van den Heuvel, W., 2019. "The trade-off between costs and carbon emissions from lot-sizing decisions," Econometric Institute Research Papers EI2019-19, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. Alves, Maria João & Costa, João Paulo, 2016. "Graphical exploration of the weight space in three-objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 248(1), pages 72-83.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-025-06536-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.