A variable neighborhood search for the median location problem with interconnected facilities

DOI10.1111/ITOR.13468MaRDI QIDQ6609699zbMATH OpenFDO

Authors I. Lozano-Osorio, Jesús Sánchez-Oro, A. D. López-Sánchez, Abraham Duarte

Publication date 24 September 2024

Published in International Transactions in Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1111/ITOR.13468

zbMATH Keywords

\(p\)-median problemfacility locationinterconnected facilitiesvariable neighborhood search

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A parallel variable neighborhood search approach for the obnoxious p‐median problem
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• Median and covering location problems with interconnected facilities
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Probabilistic Analysis of a Relaxation for the k-Median Problem
• Solution methods for thep-median problem: An annotated bibliography
• The parallel variable neighborhood search for the \(p\)-median problem
• Variable neighborhood search
• Variable neighborhood search for the p-median
• Variable neighborhood search: basics and variants

This page was built for publication: A variable neighborhood search for the median location problem with interconnected facilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609699)