| Summary: | 碩士 === 國立臺南大學 === 應用數學系碩士班 === 102 === This workconsiders the minimum covering problem by using tree derivation. Carrent methods forsolving the covering problemuse matrix nepresentation. However, using matrix to slove the minimum covering problem needs a lot of storage space . Alternatively, the work sloves the problem by tree diagram which requires less storage space. First, this work presents some rules for simplifying the problems. Sceond,the steps of tree diagram for finding all minimum coverage are proposed. Finally,a numerical example isillustrated to demonstrate the performance.
|
|---|
