A-priori upper bounds for the set covering problem

Giovanni Felici (), Sokol Ndreca (), Aldo Procacci () and Benedetto Scoppola ()
Additional contact information
Giovanni Felici: Consiglio Nazionale delle Ricerche
Sokol Ndreca: UFMG
Aldo Procacci: UFMG
Benedetto Scoppola: Universita Tor Vergata di Roma

Annals of Operations Research, 2016, vol. 238, issue 1, No 10, 229-241

Abstract: Abstract In this paper we present a new bound obtained with the probabilistic method for the solution of the set covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic results, and it depends only on the number of rows of the coefficient matrix and the row densities. We also consider the particular case of matrices that are almost block decomposable, and show how the bound may improve according to the particular decomposition adopted. Such final result may provide interesting indications for comparing different matrix decomposition strategies.

Keywords: Set covering; Probabilistic method; Matrix decomposition (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-015-2069-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:238:y:2016:i:1:d:10.1007_s10479-015-2069-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-2069-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().