Results 281 to 290 of about 1,486,783 (327)
Some of the next articles are maybe not open access.
Algorithms for the Set Covering Problem
Annals of Operations Research, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CAPRARA A., TOTH P., FISCHETTI, MATTEO
openaire +2 more sources
Exact Multi-Covering Problems with Geometric Sets
Theory of Computing Systems, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ashok, Pradeesha +3 more
openaire +1 more source
On Capacitated Set Cover Problems
2011Recently, Chakrabarty et al. [5] initiated a systematic study of capacitated set cover problems, and considered the question of how their approximability relates to that of the uncapacitated problem on the same underlying set system. Here, we investigate this connection further and give several results, both positive and negative.
Bansal, N., Krishnaswamy, R., Saha, B.
openaire +2 more sources
Probabilistic partial set covering problems
Naval Research Logistics, 1991Summary: We consider a situation in which a group of facilities need to be constructed in order to serve a given set of customers. However, the facilities cannot guarantee an absolute coverage to any of the customers. Hence, we formulate this problem as one of maximizing the total service reliability of the system subject to a budgetary constraint. For
Sherali, Hanif D. +2 more
openaire +2 more sources
International Journal of Mathematical Education in Science and Technology, 1981
The solution of the set covering problem provides an ideal illustration of tree searching techniques. In this paper a variant of the A∗ algorithm is used to efficiently search a tree to find a minimal cost cover. The paper provides an ideal case study for mathematical programmers.
openaire +1 more source
The solution of the set covering problem provides an ideal illustration of tree searching techniques. In this paper a variant of the A∗ algorithm is used to efficiently search a tree to find a minimal cost cover. The paper provides an ideal case study for mathematical programmers.
openaire +1 more source
Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem
2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2019To benefit from the location advantages provided from two main covering location problems, namely set covering location problem and maximal covering location problem, a new mathematical model is presented in this study. In this model, the main facilities are located gradually through the planning periods, providing full coverage for the incremental ...
R. Alizadeh, T. Nishi
openaire +1 more source
A special class of set covering problems
Computational Optimization and Applications, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emamy-K., M. Reza, Ramírez, A. I.
openaire +2 more sources
International Journal of General Systems, 1991
The classical set covering problem is one of the well known NP-hard problems from discrete optimization. It consists of finding the cheapest covering of a finite set with a subsystem of a finite system of its subsets and has been investigated by many authors in various formulations.
openaire +1 more source
The classical set covering problem is one of the well known NP-hard problems from discrete optimization. It consists of finding the cheapest covering of a finite set with a subsystem of a finite system of its subsets and has been investigated by many authors in various formulations.
openaire +1 more source
Requiring Connectivity in the Set Covering Problem
Journal of Combinatorial Optimization, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cerdeira, J. Orestes, Pinto, Leonor S.
openaire +2 more sources
The Set-Partitioning Problem: Set Covering with Equality Constraints
Operations Research, 1969This paper gives an enumerative algorithm for the set-partitioning problem, that is, the set-covering problem with equality constraints, and presents computational results for real and randomly generated problems. The fact that many problems can be solved more rapidly than the corresponding linear programs demonstrates the efficiency of the algorithm;
Garfinkel, R. S., Nemhauser, G. L.
openaire +2 more sources