Full metadata record
DC FieldValueLanguage
dc.contributor.authorChiang, CIen_US
dc.contributor.authorLi, JMen_US
dc.contributor.authorTzeng, GHen_US
dc.contributor.authorYu, PLen_US
dc.date.accessioned2014-12-08T15:45:48Z-
dc.date.available2014-12-08T15:45:48Z-
dc.date.issued2000en_US
dc.identifier.isbn3-540-67266-4en_US
dc.identifier.issn0075-8442en_US
dc.identifier.urihttp://hdl.handle.net/11536/30816-
dc.description.abstractCompetence set analysis is a new approach to solve an import aspect of challenging MCDM problems. Thus, many researchers have developed efficient methods for solving the optimal expansion of competence sets (please see the references). The minimum spanning table method (MST) proposed by Feng and Yu (1997) is an efficient algorithm using spreadsheet tableaus to solve optimal expansion problems. In order to develop a computer program, in this paper, we propose the revised algorithm of MST, which can efficiently solve the optimal expansion problems. We develop a user-friendly program called MINST, which can solve fairly large-scale expanding problems even with PC of pentium 133.en_US
dc.language.isoen_USen_US
dc.subjectcompetence set expansionen_US
dc.subjecthabitual domainsen_US
dc.subjectminimum spanning tableen_US
dc.titleA revised minimum spanning table method for optimal expansion of competence setsen_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.journalRESEARCH AND PRACTICE IN MULTIPLE CRITERIA DECISION MAKINGen_US
dc.citation.volume487en_US
dc.citation.spage238en_US
dc.citation.epage247en_US
dc.contributor.department運輸與物流管理系 註:原交通所+運管所zh_TW
dc.contributor.departmentDepartment of Transportation and Logistics Managementen_US
dc.identifier.wosnumberWOS:000089141200021-
Appears in Collections:Conferences Paper