Minimum spanning table and optimal expansion of competence set

Journal of Optimization Theory and Applications

Volumn 99, Issue 3, 1998, Pages 655-679

  Feng, J W ^a   Yu, P L ^b  

^a NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b UNIVERSITY OF KANSAS   (United States)

Author keywords

Competence set expansion; directed graph; habitual domains; minimum spanning tree; spanning tables

Indexed keywords

EXPANSION; TREES (MATHEMATICS);

ASYMMETRIC COSTS; COMPETENCE SET EXPANSION; COMPETENCE SETS; HABITUAL DOMAIN; MATRIX; MINIMUMS PANNING TREE; PROPERTY; SPANNING TABLE; SPANNING TREE;

DIRECTED GRAPHS;

EID: 10344221630     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021755117744     Document Type: Article

References (9)

1. YU, P. L., Forming Winning Strategies: An Integrated Theory of Habitual Domains, Springer Verlag, Berlin, Germany, 1990.
2. YU, P. L., Habitual Domains: Freeing Yourself from the Limits on Your Life, Highwater Editions, Kansas City, Kansas, 1995.
3. YU, P. L., and ZHANG, D., A Foundation for Competence Set Analysis, Mathematical Social Sciences, Vol. 20, pp. 251-299, 1990.
4. SHI, D. S., and YU, P. L., Optimal Expansion and Design of Competence Set with Asymmetric Acquiring Costs, Journal of Optimization Theory and Applications, Vol. 88, pp. 643-658, 1996.
5. LI, H. L., and YU, P. L., Optimal Competence Set Expansion Using Deduction Graphs, Journal of Optimization Theory and Applications, Vol. 80, pp. 75-91, 1994.
6. EDMONDS, J., Optimum Branching, Mathematics of Decision Science, Edited by G. B. Dantzig and A. Veinott, Lectures in Applied Mathematics, American Mathematical Society, Providence, Rhode Island, Vol. 12, pp. 346-361, 1968.
7. GONDRAN, M., and MINOUX, M., Graphs and Algorithms, John Wiley and Sons, New York, New York, 1984.
8. EVANS, J. R., and MINIEKA, E., Optimization Algorithms for Networks and Graphs, 2nd Edition, Marcel Dekker, New York, New York, 1992.
9. ROBINSON, D. F., and FOULDS, R. L., Digraphs: Theory and Techniques, Gordon and Breach Science Publishers, New York, New York, 1980.