• DOI:10.1287/moor.4.3.233
Corpus ID: 43555235

A Greedy Heuristic for the Set-Covering Problem

@article{Chvtal1979AGH,
  title={A Greedy Heuristic for the Set-Covering Problem},
  author={V. Chv{\'a}tal},
  journal={Math. Oper. Res.},
  year={1979},
  volume={4},
  pages={233-235}
}

• V. Chvátal
• Published 1979
• Mathematics, Computer Science
• Math. Oper. Res.

Let A be a binary matrix of size m × n, let cT be a positive row vector of length n and let e be the column vector, all of whose m components are ones. The set-covering problem is to minimize cTx subject to Ax ≥ e and x binary. We compare the value of the objective function at a feasible solution found by a simple greedy heuristic to the true optimum. It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A. When all the components of cT are the… Expand

View via Publisher

Save to Library

Create Alert

Cite

Launch Research Feed