Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Surprisal-Based Greedy Heuristic for the Set Covering Problem."

Tommaso Adamo et al. (2023)

> Home

Details and statistics

DOI: 10.3390/A16070321

access: open

type: Journal Article

metadata version: 2023-08-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithms/AdamoGGP23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithms/AdamoGGP23
Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero, Deborah Pareo:
A Surprisal-Based Greedy Heuristic for the Set Covering Problem. Algorithms 16(7): 321 (2023)

a service of

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.