Discrete cooperative coverage location models with alternative facility types in a probabilistic setting

DOI10.1111/ITOR.13426WikidataQ129277105 ScholiaQ129277105MaRDI QIDQ6495368

Maria Michopoulou, Ioannis Giannikos

Publication date: 30 April 2024

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

zbMATH Keywords

genetic algorithmslocation analysisdemand coveringcooperative cover

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• New heuristic algorithms for solving the planar \(p\)-median problem
• The maximin gradual cover location problem
• The variable radius covering problem
• The gradual covering decay location problem on a network.
• An efficient genetic algorithm for the \(p\)-median problem
• A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
• Undesirable facility location with minimal covering objectives
• A maximal covering location model in the presence of partial coverage
• Probability chains: a general linearization technique for modeling reliability in facility location and related problems
• A directional approach to gradual cover
• An effective genetic algorithm approach to large scale mixed integer programming problems
• Reliable Facility Location Design Under the Risk of Disruptions
• The gradual covering problem
• Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
• A stochastic gradual cover location problem
• Cooperative covering problems on networks
• Deception tactics for network interdiction: A multiobjective approach
• The Location of Emergency Service Facilities
• The generalized maximal covering location problem
• On the use of genetic algorithms to solve location problems

This page was built for publication: Discrete cooperative coverage location models with alternative facility types in a probabilistic setting