A combinatorial optimization problem ari
โ
Sandro Bosio; Giovanni Righini
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 74 KB
We study a combinatorial optimization problem related to the automatic classification of texts. The problem consists of covering a given text using strings from a given set, where a cost is incurred for each type of string used. We give a 0-1 linear programming formulation and we report on computati