Minimum spanning table and optimal expansion of competence set

DOI10.1023/A:1021755117744zbMath0945.90071OpenAlexW169593089MaRDI QIDQ1969528

Yanyan Li

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

directed graphminimum spanning treehabitual domainscompetence set expansionspanning table

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (6)

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 ⋮ 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 ⋮ Cost estimation algorithm and decision-making model for curriculum modification in educational organization ⋮ Expanding competence sets for the consumer decision problem

Cites Work

• A foundation for competence set analysis
• Optimal competence set expansion using deduction graphs
• Optimal expansion and design of competence sets with asymmetric acquiring costs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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