"What is the best greedy-like heuristic for the weighted set covering problem?"

Francis J. Vasko, Yun Lu, Kenneth Zyma (2016)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2016.03.007

access: closed

type: Journal Article

metadata version: 2022-01-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/VaskoLZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/VaskoLZ16
Francis J. Vasko, Yun Lu, Kenneth Zyma:
What is the best greedy-like heuristic for the weighted set covering problem? Oper. Res. Lett. 44(3): 366-369 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.