Median and covering location problems with interconnected facilities

DOI10.1016/J.COR.2019.03.002zbMath1458.90420OpenAlexW2922078255WikidataQ128224300 ScholiaQ128224300MaRDI QIDQ1738812

Mercedes Landete, Gilbert Laporte, Marilène Cherkesly

Publication date: 18 April 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.03.002

zbMATH Keywords

coveringfacility locationmetaheuristicmedian probleminterconnectivity

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (3)

Continuous maximal covering location problems with interconnected facilities ⋮ Advanced network connectivity features and zonal requirements in covering location problems ⋮ New formulations for two location problems with interconnected facilities

Uses Software

• VRP

Cites Work

• Looking for edge-equitable spanning trees
• The tree of hubs location problem
• Variable neighborhood search
• Greedy randomized adaptive search procedures
• A hybrid heuristic for the \(p\)-median problem
• General network design: a unified view of combined location and network design problems
• Minimizing movement
• Locating a cycle in a transportation or a telecommunications network
• A robust sensor covering and communication problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Median and covering location problems with interconnected facilities