Full metadata record
DC FieldValueLanguage
dc.contributor.authorHwang, FKen_US
dc.contributor.authorWang, YMen_US
dc.contributor.authorLee, JSen_US
dc.date.accessioned2014-12-08T15:41:43Z-
dc.date.available2014-12-08T15:41:43Z-
dc.date.issued2002-12-01en_US
dc.identifier.issn0925-5001en_US
dc.identifier.urihttp://dx.doi.org/10.1023/A:1021216024210en_US
dc.identifier.urihttp://hdl.handle.net/11536/28370-
dc.description.abstractRecently, the theory of sortability of partition property has been shown to be an effective tool to prove the existence of an optimal partition with that property. In this paper, we extend the theory to multi-partition where the partition is on t types of components. We apply our results to settle an optimal assignment problem whose proof was incomplete as given in the literature.en_US
dc.language.isoen_USen_US
dc.titleSortability of multi-partitionsen_US
dc.typeArticleen_US
dc.identifier.doi10.1023/A:1021216024210en_US
dc.identifier.journalJOURNAL OF GLOBAL OPTIMIZATIONen_US
dc.citation.volume24en_US
dc.citation.issue4en_US
dc.citation.spage463en_US
dc.citation.epage472en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000179474300005-
dc.citation.woscount2-
Appears in Collections:Articles


Files in This Item:

  1. 000179474300005.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.