組合最優化的幾個問題
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.contributor.author |
張鎮華 | en_US |
dc.contributor.author |
Chang Gerard Jennhwa | en_US |
dc.contributor.department |
交通大學應用數學系 | zh_TW |
dc.date.accessioned |
2014-12-13T10:38:08Z | |
dc.date.available |
2014-12-13T10:38:08Z | |
dc.date.issued |
1998 | en_US |
dc.description.sponsorship |
行政院國家科學委員會 | zh_TW |
dc.identifier.govdoc |
NSC87-2115-M009-007 | zh_TW |
dc.identifier.uri |
https://www.grb.gov.tw/search/planDetail?id=359870&docId=64378 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/95092 | |
dc.language.iso |
zh_TW | en_US |
dc.subject |
組合最優化 | zh_TW |
dc.subject |
寬直徑 | zh_TW |
dc.subject |
漢米爾頓圈 | zh_TW |
dc.subject |
區間圖 | zh_TW |
dc.subject |
弦圖 | zh_TW |
dc.subject |
著色問題 | zh_TW |
dc.subject |
區間數 | zh_TW |
dc.subject |
最優剖分 | zh_TW |
dc.subject |
Combinatorial optimization | en_US |
dc.subject |
Wide-diameter | en_US |
dc.subject |
Hamiltonian cycle | en_US |
dc.subject |
Interval graph | en_US |
dc.subject |
Chordal graph | en_US |
dc.subject |
Coloring problem | en_US |
dc.subject |
Interval number | en_US |
dc.subject |
Optimal partition | en_US |
dc.title |
組合最優化的幾個問題 | zh_TW |
dc.title |
Problems in Combinatorial Optimization | en_US |
dc.type |
Plan | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 研究計畫