Full metadata record
DC FieldValueLanguage
dc.contributor.author王毓閔en_US
dc.contributor.authorYu-Min Wangen_US
dc.contributor.author黃光明en_US
dc.contributor.authorFrank K. Hwangen_US
dc.date.accessioned2014-12-12T02:26:18Z-
dc.date.available2014-12-12T02:26:18Z-
dc.date.issued2000en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#NT890507023en_US
dc.identifier.urihttp://hdl.handle.net/11536/67704-
dc.description.abstract最近對於從所有可能的分配中找到最優的分配問題,我們已經發現到「可整理性」之理論是一個很重要的工具。至今,對於一個單一種類的分配問題來說,「可整理性」已經研究討論的相當透徹,但是有很多實際的問題都需要同時考慮很多種類的東西分配在一起的情形,所以我們才會想要研究這多種類的「可整理性」以期望能夠知道何種分配能達到最佳的狀態。在這一篇論文中我們首先提出這一個問題,並獲得不少結果。zh_TW
dc.description.abstractThe theory of sortability of partition property has recently been shown to be an effective tool to prove the existence of an optimal partition with that property. And some combinatorial properties of single-partition have been well studied. We extend this study to multi-partition with the hope to benefit optimal multi-partition problems.en_US
dc.language.isoen_USen_US
dc.subject可整理性zh_TW
dc.subject多類分解zh_TW
dc.subjectsortabilityen_US
dc.subjectmuti-partitionsen_US
dc.title多類分解的可整理性zh_TW
dc.titleSortability of Multi-partitionsen_US
dc.typeThesisen_US
dc.contributor.department應用數學系所zh_TW
Appears in Collections:Thesis