Discrete cooperative coverage location models with alternative facility types in a probabilistic setting
From MaRDI portal
Publication:6495368
DOI10.1111/ITOR.13426WikidataQ129277105 ScholiaQ129277105MaRDI QIDQ6495368FDOQ6495368
Authors: Maria Michopoulou, Ioannis Giannikos 
Publication date: 30 April 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Cites Work
- An efficient genetic algorithm for the \(p\)-median problem
- Reliable facility location design under the risk of disruptions
- Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects
- The Location of Emergency Service Facilities
- On the use of genetic algorithms to solve location problems
- The gradual covering decay location problem on a network.
- A maximal covering location model in the presence of partial coverage
- The gradual covering problem
- A stochastic gradual cover location problem
- The generalized maximal covering location problem
- Evolutionary computation. 1. Basic algorithms and operators
- Probability chains: a general linearization technique for modeling reliability in facility location and related problems
- Cooperative covering problems on networks
- New heuristic algorithms for solving the planar \(p\)-median problem
- The maximin gradual cover location problem
- The variable radius covering problem
- An effective genetic algorithm approach to large scale mixed integer programming problems
- Undesirable facility location with minimal covering objectives
- Deception tactics for network interdiction: a multiobjective approach
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
- A directional approach to gradual cover
This page was built for publication: Discrete cooperative coverage location models with alternative facility types in a probabilistic setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495368)
