Minimum Spanning Table and Optimal Expansion of Competence Set

J. W. Feng and P. L. Yu
Additional contact information
J. W. Feng: Nanjing University of Science and Technology
P. L. Yu: University of Kansas

Journal of Optimization Theory and Applications, 1998, vol. 99, issue 3, No 4, 655-679

Abstract: Abstract Each directed graph with asymmetric costs defined over its arcs can be represented by a matrix or table, called an expansion table. We explore first the basic properties of cycles and spanning tables of expansion tables, which correspond to the cycles and spanning trees of the directed graph. Then, we derive an algorithm to find a minimum spanning table which corresponds to a minimum spanning tree in the directed graph. Finally, we discuss how to use the algorithm to find the optimal competence set expansion and also discuss related problems.

Keywords: Competence set expansion; habitual domains; spanning tables; minimum spanning tree; directed graph (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1023/A:1021755117744 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:99:y:1998:i:3:d:10.1023_a:1021755117744

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1021755117744

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().