Results 61 to 70 of about 2,701,676 (183)
(Non-)existence of Polynomial Kernels for the Test Cover Problem [PDF]
, 2012 The input of the Test Cover problem consists of a set $V$ of vertices, and a collection ${\cal E}=\{E_1,..., E_m\}$ of distinct subsets of $V$, called tests.
Gutin, G., Muciaccia, G., Yeo, A.
core
Approximation of the Quadratic Set Covering problem
Discrete Optimization, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Escoffier, Bruno, Hammer, Peter
openaire +2 more sources
A hybrid algorithm for flexible job-shop scheduling problem with setup times
International Journal of Production Management and Engineering, 2017 Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines.
Ameni Azzouz +2 more
doaj +1 more source
An indirect genetic algorithm for set covering problems [PDF]
Journal of the Operational Research Society, 2002 This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with permutations of the solution variables and other ...
openaire +6 more sources
A New and Fast Approximation Algorithm for Vertex Cover Using a Maximum Independent Set (VCUMI)
Operations Research and Decisions, 2015 The importance of non-deterministic polynomial (NP) problems in real world scenarios has compelled researchers to consider simple ways of finding approximate solutions to these problems in polynomial time.
Imran Khan, Naveed Riaz
doaj
Sensor scheduling for target coverage in directional sensor networks
International Journal of Distributed Sensor Networks, 2017 Directional sensor networks have a lot of practical applications, and target coverage is one of the most important issues. In this article, we study the target coverage problem in directional sensor network, where directional sensors can rotate freely ...
Jinglan Jia +4 more
doaj +1 more source
Solution techniques for the Large Set Covering Problem
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galinier, Philippe, Hertz, Alain
openaire +3 more sources
A Minimum Set-Cover Problem with several constraints [PDF]
Annals of computer science and information systems, 2019 Jens Dörpinghaus +2 more
doaj +1 more source
International Journal of Distributed Sensor Networks, 2012 Area coverage is one of the key issues for wireless sensor networks. It aims at selecting a minimum number of sensor nodes to cover the whole sensing region and maximizing the lifetime of the network.
Xiu Deng +3 more
doaj +1 more source