A-priori upper bounds for the set covering problem
From MaRDI portal
Publication:271942
DOI10.1007/s10479-015-2069-0zbMath1334.90144arXiv1407.4520OpenAlexW2278209031MaRDI QIDQ271942
Benedetto Scoppola, Aldo Procacci, Sokol Ndreca, Giovanni Felici
Publication date: 20 April 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.4520
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- An effective and simple heuristic for the set covering problem
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Computational experience with approximation algorithms for the set covering problem
- Bounding the probability of the union of events by aggregation and disaggregation in linear programs
- Fast matrix decomposition in \(\mathbb F_2\)
- New approaches to nurse rostering benchmark instances
- A threshold of ln n for approximating set cover
- A Greedy Heuristic for the Set-Covering Problem
- Note—A Computational Survey of Methods for the Set Covering Problem
- Bounds on the probability of the union and intersection of m events
- A statistical mechanics analysis of the set covering problem
- Decomposing Matrices into Blocks
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- A set covering based matheuristic for a real‐world city logistics problem
- Polynomially Computable Bounds for the Probability of the Union of Events
- Set covering approach for reconstruction of sibling relationships
- Algorithms for the set covering problem
This page was built for publication: A-priori upper bounds for the set covering problem
