Minimum spanning table and optimal expansion of competence set

DOI10.1023/A:1021755117744MaRDI QIDQ1969528zbMATH OpenOpenAlexFDO

Authors Yanyan Li, Po-Lung Yu, J. W. Feng

Publication date 29 May 2000

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021755117744

zbMATH Keywords

competence set expansiondirected graphhabitual domainsminimum spanning treespanning table

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Review text

Each directed graph with asymmetric costs over its arcs can be represented by a table (matrix) called an expansion table. An expansion table is a spanning table if the corresponding directed graph is a tree spanning over each node of the graph. After decribing properties of the spanning tables an algorithm to find a minimum spanning table in a given expansion table is given in the paper. This algorithm is applied to find an optimal expansion process for competence sets (the competence set is an adequate set of skills for solving a problem or a set of problems). Two cases are considered: (1) expansion from skills to skills and (2) expansion from compound skills to other skills.

Recommendations

• A revised minimum spanning table method for optimal expansion of competence sets
• A combinatorial optimization approach for the competence set expansion problem
• Optimal competence set expansion
• Optimal competence set expansion using deduction graphs
• Optimal Expansion Of Competence Sets And Decision Support
• Optimal expansion of competence sets with intermediate skills and compound nodes
• Min-Max Graph Partitioning and Small Set Expansion
• Optimality computation of the minimum stretch spanning tree problem
• min-max spaces and complexity reduction in min-max expansions

Cites work

• A foundation for competence set analysis
• scientific article; zbMATH DE number 3989126 (Why is no real title available?)
• scientific article; zbMATH DE number 3760195 (Why is no real title available?)
• scientific article; zbMATH DE number 482901 (Why is no real title available?)
• Optimal competence set expansion using deduction graphs
• Optimal expansion and design of competence sets with asymmetric acquiring costs

Cited in

(9)

• Cost estimation algorithm and decision-making model for curriculum modification in educational organization
• Expanding competence sets for the consumer decision problem
• Dynamic multiple criteria decision making in changeable spaces: from habitual domains to innovation dynamics
• Dynamic MCDM, habitual domains and competence set analysis for effective decision making in changeable spaces
• A combinatorial optimization approach for the competence set expansion problem
• Optimal Expansion Of Competence Sets And Decision Support
• A revised minimum spanning table method for optimal expansion of competence sets
• Acquisition of compound skills and learning costs for expanding competence sets
• Grey relational analysis and radial basis function network for determining costs in learning sequences

This page was built for publication: Minimum spanning table and optimal expansion of competence set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969528)