Results 271 to 280 of about 536,987 (307)

A Genetic Algorithm for the Set Covering Problem

Journal of the Operational Research Society, 1996
Summary: The set covering problem (SCP) is considered. Several algorithms have been suggested in the literature for solving it. We propose a new algorithm for solving the SCP which is based on the genetic technique. This algorithm has been implemented and tested on various standard and randomly generated test problems.
Al-Sultan, K. S., Hussain, M. F., Nizami, J. S.   +2 more
openaire   +2 more sources

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

A heuristic algorithm for the set covering problem

1996
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The main characteristics of the algorithm we propose are (1) a dynamic pricing scheme for the variables, akin to that used for solving large-scale LP's, to be coupled with subgradient optimization and greedy algorithms, and (2) the systematic use of column fixing to ...
Caprara A., Fischetti M., Toth P.
openaire   +2 more sources

Approximation of a Geometric Set Covering Problem

2001
We consider a special set covering problem. This problem is a generalization of finding a minimum clique cover in an interval graph. When formulated as an integer program, the 0-1 constraint matrix of this integer program can be partitioned into an interval matrix and a special 0-1 matrix with a single 1 per column.
Sofia Kovaleva, Frits C. R. Spieksma
openaire   +1 more source

A hybrid heuristic for the set covering problem

Operational Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shyam Sundar 0001, Alok Singh 0001
openaire   +2 more sources

Ant system for the set covering problem

2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236), 2002
Ant colony optimization (ACO) is a metaheuristic inspired by the biological behavior of Argentine ants, which cooperate with each other by means of pheromone deposit and evaporation. The ant system (AS), one of the instances of this general optimization approach, has been applied to different optimization problems.
Ricardo Martins de Abreu Silva, Geber L. Ramalho   +1 more
openaire   +1 more source

Customisable architectures for the set covering problem

ACM SIGARCH Computer Architecture News, 2013
This paper proposes novel customisable streaming architectures for the NP-hard set covering problem. Our approach covers both exhaustive and genetic algorithms, supporting coarse-grain parallelism and deep pipelines while allowing trade-offs between performance and resource usage.
Liucheng Guo, David B. Thomas, Wayne Luk
openaire   +1 more source

On approximation of the submodular set cover problem

Operations Research Letters, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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

On the Fractional Solution to the Set Covering Problem

SIAM Journal on Algebraic Discrete Methods, 1983
We study the gap between the value of the integer solution to the set covering problem and the value of the fractional solution that solves the linear programming relaxation of this problem.
openaire   +2 more sources