Computer Science ›› 2007, Vol. 34 ›› Issue (4): 133-136.
Previous Articles Next Articles
CHEN Duan-Bing ,HUANG Wen-Qi （School of Computer Science, Huazhong University of Science and Technology, Wuhan 430074）
Online:
Published:
Abstract: The set/covering problem is a fundamental combinatorial problem in operations research. It is usually described as the problem of covering the rows of this m-row, n-column, 0-1 matrix （au）rex, by a subset of the columns at minimal cost. This problem has m
Key words: Set covering problem, Heuristic algorithm, Greedy strategy, Random off-trap
CHEN Duan-Bing ,HUANG Wen-Qi （School of Computer Science, Huazhong University of Science and Technology, Wuhan 430074）. [J].Computer Science, 2007, 34(4): 133-136.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2007/V34/I4/133
Cited
Home