Results 141 to 150 of about 2,701,676 (183)

The set covering problem

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

Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem

2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2019
To 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, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emamy-K., M. Reza, Ramírez, A. I.
openaire   +2 more sources

FUZZY SET COVERING PROBLEM

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

Requiring Connectivity in the Set Covering Problem

Journal of Combinatorial Optimization, 2005
zbMATH 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, 1969
This 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

Reoptimization of set covering problems

Cybernetics and Systems Analysis, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Heuristic Method for the Set Covering Problem

Operations Research, 1999
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows and 1,000,000 columns, arising from crew scheduling in the Italian Railway Company, Ferrovie dello Stato SpA.
Caprara A., Fischetti M., Toth P.
openaire   +4 more sources

Cultural Algorithms for the Set Covering Problem

2013
This paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem is a reasonably well known NP-complete optimization problem with many real world applications. We use a cultural evolutionary architecture to maintain knowledge of diversity and fitness learned over each generation during the
Crawford, Broderick, Soto, Ricardo, Monfroy, Eric   +2 more
openaire   +2 more sources

A Lagrangean Heuristic for Set Covering Problems

Naval Research Logistics, 1990
The set covering problem (SCP) is the problem of covering the rows of a m row, n column, zero-one matrix by a subset of the columns at minimum cost.
openaire   +1 more source