Name
Abstract | ||
|---|---|---|
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 computational experiences on very large instances using two different Lagrangean relaxations and heuristic algorithms based on simulated annealing and threshold accepting. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S1571-0653(04)00429-9 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Texts classfication,simulated annealing,threshold accepting,Lagrangean relaxation | Simulated annealing,Heuristic,Linear programming formulation,Mathematical optimization,Combinatorial optimization problem,Algorithm,Optimization problem,Mathematics | Journal |
Volume | ISSN | Citations |
13 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sandro Bosio | 1 | 75 | 7.28 |
| Giovanni Righini | 2 | 520 | 33.90 |