Results 151 to 160 of about 1,485,911 (189)
Some of the next articles are maybe not open access.
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
Set Cover Problems with Small Neighborhood Covers
Theory of Computing Systems, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Agarwal, Archita +4 more
openaire +2 more sources
Reoptimization of set covering problems
Cybernetics and Systems Analysis, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A Heuristic Method for the Set Covering Problem
Operations Research, 1999We 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
2013This 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 +2 more
openaire +2 more sources
A Lagrangean Heuristic for Set Covering Problems
Naval Research Logistics, 1990The 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
A Note on the Set Covering Problem
Journal of the Operational Research Society, 1982A 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
Set Covering Probleme in der Funknetzplanung
2023Cottbus Mathematical Preprints; 29 ...
openaire +1 more source
An algorithm for set covering problem
European Journal of Operational Research, 1987zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The Set Cover with Pairs Problem
2005We 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