.png){kind=icon}
.png){kind=icon}
Return
Computational approaches to a combinatorial optimization problem arising from text classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2005.07.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a combinatorial optimization problem with a particular cost structure: a constrained set of elements must be chosen from a ground set and the ground set is partitioned into subsets corresponding to types of elements. The constraints concern the elements, whereas the solution cost does not depend on the elements but only on their types. The motivation of this study comes from text categorization but we believe that the same combinatorial structure may emerge in many different contexts. We prove that the problem is NP-hard. We give a 0-1 linear programming formulation and we report on computational experiences on very large instances using branch-and-bound algorithms based on two different Lagrangean relaxations and heuristic algorithms based on Threshold Accepting and Simulated Annealing. (c) 2005 Elsevier Ltd. All rights reserved.
Keywords:
combinatorial optimization
Lagrangean relaxation
threshold accepting
simulated annealing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available