Skip to search formSkip to main contentSkip to account menu

Covering problems

Known as: Covering, Covering problem 
In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Bipartite dimensionComputer scienceLinear programmingPetri net

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Meta-Optimization Approach for Covering Problems in Facility Location
In this paper, we solve the Set Covering Problem with a meta-optimization approach. One of the most popular models among facility… 
Review
2015
Review
2015
Covering Location Problems
When deciding where to locate facilities (e.g., emergency points where an ambulance will wait for a call) that provide a service… 
Review
2010
Review
2010
Mathematical model and efficient algorithms for object packing problem
Highly Cited
2009
Highly Cited
2009
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
In this paper we introduce a new general approximation method for set covering problems, based on the combination of randomized… 
Highly Cited
2001
Highly Cited
2001
Optimal Investment in Knowledge within a Firm Using a Market Mechanism
There has been an extensive research literature on auctions, but recent developments in technology have resulted in new interest… 
Highly Cited
1999
Highly Cited
1999
A new version of ant system for subset problems
Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., traveling… 
Highly Cited
1998
Highly Cited
1998
A multi-objective model for locating fire stations
Highly Cited
1996
Highly Cited
1996
On solving covering problems
The set covering problem and the minimum cost assignment problem (respectively known as unate and binate covering problem) arise… 
Highly Cited
1994
Highly Cited
1994
Using a genetic algorithm to optimize problems with feasibility constraints
G.E. Liepins et al. (1990) have shown that genetic algorithm optimization of certain combinatorial optimization problems can be… 
Highly Cited
1985
Highly Cited
1985
A formal model of diagnostic inference. I. Problem formulation and decomposition
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)