A variable neighborhood search for the median location problem with interconnected facilities
From MaRDI portal
Publication:6609699
DOI10.1111/ITOR.13468MaRDI QIDQ6609699FDOQ6609699
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)
Cites Work
- Title not available (Why is that?)
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Variable neighborhood search
- Solution methods for thep-median problem: An annotated bibliography
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Greedy randomized adaptive search procedures
- Variable neighborhood search for the p-median
- Median and covering location problems with interconnected facilities
- The parallel variable neighborhood search for the \(p\)-median problem
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Probabilistic Analysis of a Relaxation for the k-Median Problem
- Variable neighborhood search: basics and variants
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
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)