IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v25y2025i2d10.1007_s11067-024-09645-z.html
   My bibliography  Save this article

Node Coincidence in Metric Minimum Weighted Length Graph Embeddings

Author

Listed:
  • Frank Plastria

    (Vrije Universiteit Brussel)

Abstract

The minisum multifacility location problem is viewed as finding an embedding of a graph in a metric space under additional constraints such as a number of fixed vertex locations, minimising the sum of weighted lengths of all edges. We show that certain nontrivial minimal cuts in the graph are sets of nodes that will necessarily coincide at any or at some optimal solution, irrespective of the fixed locations and the metric. This new property strongly generalises all coincidence conditions known in literature. In fact we show that it is best possible for coincidence with a fixed vertex at any position in arbitrary metric spaces. For coincidence among free vertices a different property of graph symmetry is also sufficient, and we conjecture its best possibility in conjunction with the minimal cut condition. All such instance-independent coincidences (both in at least one and in all optimal solutions) may be determined efficiently.

Suggested Citation

  • Frank Plastria, 2025. "Node Coincidence in Metric Minimum Weighted Length Graph Embeddings," Networks and Spatial Economics, Springer, vol. 25(2), pages 533-565, June.
    • Handle: RePEc:kap:netspa:v:25:y:2025:i:2:d:10.1007_s11067-024-09645-z
    DOI: 10.1007/s11067-024-09645-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-024-09645-z
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-024-09645-z?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. Halit Üster & Robert F. Love, 2002. "Duality in constrained multi‐facility location models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(4), pages 410-421, June.
    2. Frank Plastria, 2009. "Asymmetric distances, semidirected networks and majority in Fermat–Weber problems," Annals of Operations Research, Springer, vol. 167(1), pages 121-155, March.
    3. Fliege, Jorg, 1998. "Coincidence conditions in multifacility location problems with positive and negative weights," European Journal of Operational Research, Elsevier, vol. 104(2), pages 310-320, January.
    4. J. Fliege, 1997. "Nondifferentiability Detection and Dimensionality Reduction in Minisum Multifacility Location Problems," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 365-380, August.
    5. Henrik Juel & Robert F. Love, 1980. "Sufficient Conditions for Optimal Facility Locations to Coincide," Transportation Science, INFORMS, vol. 14(2), pages 125-129, May.
    6. Plastria, Frank, 1987. "Solving general continuous single facility location problems by cutting planes," European Journal of Operational Research, Elsevier, vol. 29(1), pages 98-110, April.
    7. O. Lefebvre & C. Michelot & F. Plastria, 1991. "Sufficient Conditions for Coincidence in Minisum Multifacility Location Problems with a General Metric," Operations Research, INFORMS, vol. 39(3), pages 437-442, June.
    8. Barbaros C. Tansel & Richard L. Francis & Timothy J. Lowe, 1983. "State of the Art---Location on Networks: A Survey. Part II: Exploiting Tree Network Structure," Management Science, INFORMS, vol. 29(4), pages 498-511, April.
    9. Frank Plastria, 2021. "Using the power of ideal solutions: simple proofs of some old and new results in location theory," 4OR, Springer, vol. 19(3), pages 449-467, September.
    10. Barbaros C. Tansel & Richard L. Francis & Timothy J. Lowe, 1983. "State of the Art---Location on Networks: A Survey. Part I: The p-Center and p-Median Problems," Management Science, INFORMS, vol. 29(4), pages 482-497, April.
    11. Jean-Claude Picard & H. Donald Ratliff, 1978. "A Cut Approach to the Rectilinear Distance Facility Location Problem," Operations Research, INFORMS, vol. 26(3), pages 422-433, June.
    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. J. Fliege, 1997. "Nondifferentiability Detection and Dimensionality Reduction in Minisum Multifacility Location Problems," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 365-380, August.
    2. Frank Plastria, 2009. "Asymmetric distances, semidirected networks and majority in Fermat–Weber problems," Annals of Operations Research, Springer, vol. 167(1), pages 121-155, March.
    3. João António Zeferino, 2020. "Optimizing the location of aerial resources to combat wildfires: a case study of Portugal," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 100(3), pages 1195-1213, February.
    4. Gregory Dobson & Euthemia Stavrulaki, 2007. "Simultaneous price, location, and capacity decisions on a line of time‐sensitive customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 1-10, February.
    5. Peeters, Peter H., 1998. "Some new algorithms for location problems on networks," European Journal of Operational Research, Elsevier, vol. 104(2), pages 299-309, January.
    6. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    7. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.
    8. Fadda, Edoardo & Manerba, Daniele & Cabodi, Gianpiero & Camurati, Paolo Enrico & Tadei, Roberto, 2021. "Comparative analysis of models and performance indicators for optimal service facility location," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    9. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    10. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    11. Carrizosa, Emilio & Ramírez-Ayerbe, Jasone & Romero Morales, Dolores, 2024. "Mathematical optimization modelling for group counterfactual explanations," European Journal of Operational Research, Elsevier, vol. 319(2), pages 399-412.
    12. Plastria, Frank, 2016. "How bad can the centroid be?," European Journal of Operational Research, Elsevier, vol. 252(1), pages 98-102.
    13. Corinna Heßler & Kaouthar Deghdak, 2017. "Discrete parallel machine makespan ScheLoc problem," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1159-1186, November.
    14. Carrizosa, E. J. & Puerto, J., 1995. "A discretizing algorithm for location problems," European Journal of Operational Research, Elsevier, vol. 80(1), pages 166-174, January.
    15. Metev, Boyan, 1995. "Use of reference points for solving MONLP problems," European Journal of Operational Research, Elsevier, vol. 80(1), pages 193-203, January.
    16. Francesco Bonavolontà & Vincenzo Caragallo & Alessandro Fatica & Annalisa Liccardo & Adriano Masone & Claudio Sterle, 2021. "Optimization of IEDs Position in MV Smart Grids through Integer Linear Programming," Energies, MDPI, vol. 14(11), pages 1-16, June.
    17. Carrizosa, Emilio & Conde, Eduardo, 2002. "A fractional model for locating semi-desirable facilities on networks," European Journal of Operational Research, Elsevier, vol. 136(1), pages 67-80, January.
    18. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    19. Adarsh Kumar Singh & Nachiappan Subramanian & Kulwant Singh Pawar & Ruibin Bai, 2018. "Cold chain configuration design: location-allocation decision-making using coordination, value deterioration, and big data approximation," Annals of Operations Research, Springer, vol. 270(1), pages 433-457, November.
    20. Leo Liberti, 2020. "Rejoinder on: Distance geometry and data science," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 350-357, July.

    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:kap:netspa:v:25:y:2025:i:2:d:10.1007_s11067-024-09645-z. 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.