|
|
|
|
|
Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero and Deborah Pareo
In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the c...
ver más
|
|
|
|
|