๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A combinatorial optimization problem arising from text classification

โœ Scribed by Sandro Bosio; Giovanni Righini

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
74 KB
Volume
13
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

A Dynkin diagram classification theorem
A Dynkin diagram classification theorem arising from a combinatorial problem
โœ Robert A. Proctor ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 646 KB

## Los .4ngrlrs. Caljf'orrlia 90024 A combinatorial-linear algebraic condition suflicient for a ranked partially ordered set to be rank unimodal and strongly Sperner is presented. The distributive lattices which satisfy this condition are classified. These lattices are indexed by Dynkin diagrams