Results 261 to 270 of about 536,987 (307)

Algorithms for the Set Covering Problem

Annals of Operations Research, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CAPRARA A., TOTH P., FISCHETTI, MATTEO
openaire   +2 more sources

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

On Capacitated Set Cover Problems

2011
Recently, 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

Requiring Connectivity in the Set Covering Problem

Journal of Combinatorial Optimization, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. Orestes Cerdeira, Leonor Santiago Pinto   +1 more
openaire   +2 more sources

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

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

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

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

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

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