Concepts and applications of backup coverage
Management Science
Optimal solution of set covering/partitioning problems using dual heuristics
Management Science
The capacitated maximal covering location problem with backup service
Annals of Operations Research
A Lagrangian-based heuristic for large-scale set covering problems
Mathematical Programming: Series A and B - Special issue on computational integer programming
Using homogeneous weights for approximating the partial cover problem
Journal of Algorithms
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
Journal of Heuristics
The generalized maximal covering location problem
Computers and Operations Research - Location analysis
A parallel genetic algorithm to solve the set-covering problem
Computers and Operations Research
Design of supply-chain logistics system considering service level
Computers and Industrial Engineering - Supply chain management
Approximation Algorithms for Partial Covering Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Computing small partial coverings
Information Processing Letters
A Heuristic Method for the Set Covering Problem
Operations Research
The Probabilistic Set-Covering Problem
Operations Research
Models and Algorithms for Integration of Vehicle and Crew Scheduling
Journal of Scheduling
A maximal covering location model in the presence of partial coverage
Computers and Operations Research
Approximation algorithms for partial covering problems
Journal of Algorithms
Experimental analysis of approximation algorithms for the vertex cover and set covering problems
Computers and Operations Research
Euclidean push-pull partial covering problems
Computers and Operations Research
A General Global Optimization Approach for Solving Location Problems in the Plane
Journal of Global Optimization
Computers and Industrial Engineering
Solution techniques for the Large Set Covering Problem
Discrete Applied Mathematics
A GIS supported ant algorithm for the linear feature covering problem with distance constraints
Decision Support Systems
Solution approaches for facility location of medical supplies for large-scale emergencies
Computers and Industrial Engineering
A GRASP algorithm to solve the unicost set covering problem
Computers and Operations Research
Spectral projected subgradient with a momentum term for the Lagrangean dual approach
Computers and Operations Research
Regional service coverage modeling
Computers and Operations Research
The minimum weighted covering location problem with distance constraints
Computers and Operations Research
Solving the maximal covering location problem with heuristic concentration
Computers and Operations Research
A multiperiod set covering location model for dynamic redeployment of ambulances
Computers and Operations Research
Coverage optimization in continuous space facility siting
International Journal of Geographical Information Science
Maximizing the number of obnoxious facilities to locate within a bounded region
Computers and Operations Research
The Ordered Gradual Covering Location Problem on a Network
Discrete Applied Mathematics
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
MIP reformulations of the probabilistic set covering problem
Mathematical Programming: Series A and B
An RFID network design methodology for asset tracking in healthcare
Decision Support Systems
A mixed integer linear program and tabu search approach for the complementary edge covering problem
Advances in Engineering Software
Review: Generalized coverage: New developments in covering location models
Computers and Operations Research
Non-cooperative facility location and covering games
Theoretical Computer Science
Tabu based heuristics for the generalized hierarchical covering location problem
Computers and Industrial Engineering
A nearly optimal algorithm for covering the interior of an Art Gallery
Pattern Recognition
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Covering many or few points with unit disks
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Solving a fuzzy set-covering problem
Mathematical and Computer Modelling: An International Journal
An alternative formulation for certain fuzzy set-covering problems
Mathematical and Computer Modelling: An International Journal
Joint location and dispatching decisions for Emergency Medical Services
Computers and Industrial Engineering
Determination of the locations and capacities of sugar cane loading stations in Thailand
Computers and Industrial Engineering
Consensus-based decision support for multicriteria group decision making
Computers and Industrial Engineering
Applied p-median and p-center algorithms for facility location problems
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In this study, we review the covering problems in facility location. Here, besides a number of reviews on covering problems, a comprehensive review of models, solutions and applications related to the covering problem is presented after Schilling, Jayaraman, and Barkhi (1993). This survey tries to review all aspects of the covering problems by stressing the works after Schilling, Jayaraman, and Barkhi (1993). We first present the covering problems and then investigate solutions and applications. A summary and future works conclude the paper.