On a facility location problem with applications to tele-diagnostic

DOI10.1007/s11590-012-0495-3zbMath1273.90103WikidataQ61609402 ScholiaQ61609402MaRDI QIDQ360498

Massimiliano Caramia, Giuseppe F. Italiano, Nicola Apollonio

Publication date: 27 August 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0495-3

zbMATH Keywords

location problems; graph algorithms; algorithm complexity

Mathematics Subject Classification ID

90B80: Discrete location and assignment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
• Models and exact solutions for a class of stochastic location-routing problems
• Capacitated facility location problem with general setup cost
• Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A Dual-Based Procedure for Stochastic Facility Location
• The Simple Plant-Location Problem under Uncertainty
• The facility location problem with general cost functions
• Local Search Heuristics for k-Median and Facility Location Problems
• Facility location models for immobile servers with stochastic demand