標題: A revised minimum spanning table method for optimal expansion of competence sets
作者: Chiang, CI
Li, JM
Tzeng, GH
Yu, PL
運輸與物流管理系 註:原交通所+運管所
Department of Transportation and Logistics Management
關鍵字: competence set expansion;habitual domains;minimum spanning table
公開日期: 2000
摘要: Competence 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.
URI: http://hdl.handle.net/11536/30816
ISBN: 3-540-67266-4
ISSN: 0075-8442
期刊: RESEARCH AND PRACTICE IN MULTIPLE CRITERIA DECISION MAKING
Volume: 487
起始頁: 238
結束頁: 247
Appears in Collections:Conferences Paper