Results 121 to 130 of about 149,933 (163)

A special class of set covering problems

Computational Optimization and Applications, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. R. Emamy-K, A. I. Ramírez
openaire   +2 more sources

The Set Cover with Pairs Problem

2005
We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects that induces a collection of pairs covering all elements. Formally, let U be a ground set of elements and let ${\cal S}$ be a set of objects, where each object i has a non-negative cost ...
Refael Hassin, Danny Segev
openaire   +1 more source

Solving hard set covering problems

Operations Research Letters, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MANNINO, Carlo, SASSANO, Antonio
openaire   +3 more sources

A Note on the Set Covering Problem

Journal of the Operational Research Society, 1982
A previously published work on a ‘probabilistic’ formulation of the set covering problem is discussed. Attention is drawn to the dependence of the feasible locations of facilities on the way the continuous space of incidents is divided into subregions when using either the above formulation or the standard deterministic formulation of the set covering ...
openaire   +1 more source

On the geometric priority set cover problem

Computational Geometry, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aritra Banik, Rajiv Raman 0001, Saurabh Ray   +2 more
openaire   +1 more source

On the Set-Covering Problem: II. An Algorithm for Set Partitioning

Operations Research, 1975
In an earlier paper [Opns. Res. 20 1153–1161 (1972)] we proved that any feasible integer solution to the linear program associated with the equality-constrained set-covering problem can be obtained from any other feasible integer solution by a sequence of less than m pivots (where m is the number of equations), such that each solution generated in the
Egon Balas, Manfred Padberg
openaire   +2 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
Broderick Crawford, Ricardo Soto 0001, Éric Monfroy   +2 more
openaire   +2 more sources

Solving the set cover problem on a supercomputer

Parallel Computing, 1990
Abstract Supercomputers, such as CRAY-1, CRAY X-MP, CYBER 205, ETA10, … etc, have been regularly used for solving numerical problems. It is very rare that supercomputers are used to solve combinatorial problems. In this paper, we present an efficient vectorized algorithm to solve the set cover problem, which was proved to be NP-complete, on a ...
Shyong Jian Shyu, Richard C. T. Lee
openaire   +1 more source

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;
Robert S. Garfinkel, George L. Nemhauser
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