The problem of the optimal biobjective spanning tree

European Journal of Operational Research

Volumn 111, Issue 3, 1998, Pages 617-628

  Ramos, R M ^a   Alonso, S ^b   Sicilia, J ^b   Gonzalez, C ^b  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Biobjective optimal cost spanning tree; Minimum cost spanning tree; Multi criteria analysis; Spanning tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; DECISION THEORY; OPTIMIZATION; PROBLEM SOLVING;

BIOBJECTIVE OPTIMAL COST SPANNING TREE; MINIMUM COST SPANNING TREE; MULTI-CRITERIA ANALYSIS;

TREES (MATHEMATICS);

EID: 0032314874     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00391-3     Document Type: Article

References (19)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. P.M. Camerini, G. Galbiati, F. Maffioli, Algorithm for finding optimum trees: Description, use and evaluation, Annals of Operations Research 13 (1988) 265-397.
3. A. Cayley, Collected papers, Quarterly Journal of Mathematics 13 (1987) 26.
4. W.K. Chen, H.C. Li, Computer generation of directed trees and complete trees, International Journal of Electronics 34 (1973) 1.
5. H.W. Corley, Efficient spanning trees, Journal of Optimization Theory and Applications 45 (3) (1985) 481-485.
6. R. Fletcher, Practical Methods of Optimization, vols. 1 and 2, Wiley, New York, 1987.
7. H.N. Gabow, E.W. Myers, Finding all spanning trees of directed and undirected graphs, SIAM Journal on Computing 7 (1978) 280-287.
8. R.L. Graham, P. Hell, On the history of the minimum spanning tree problem, Annals of the History of Computing 7 (1) (1985) 43-57.
9. H.W. Hammacker, G. Ruhe, On spanning tree problems with multiple objectives, Annals of Operations Research 52 (1994) 209-230.
10. S. Kapoor, H. Ramesh, Algorithms for enumerating all spanning tree of undirected and weighted graphs, SIAM Journal on Computing 24 (1995) 247-265.
11. G. Kirchhoff, Über die Auflösung der Gleichungen, anf welche man bei der Untersuchung der Linearen Verteilung Galvanisher Ströme Geführt Wird, Poggendorg's Annalen der Physik and Chemie 72 (1847) 497-508.
12. J.B. Kruskal, On the shortest spanning tree of a graph and the traveling salesman problem, Proceedings of American Mathematical Society 7 (1956) 48-50.
13. W. Mayeda, S.L. Hakimi, W.K. Chen, N. Deo, Generation of complete trees, IEEE Transaction CT 15 (1968) 101.
14. R.C. Prim, Shortest connection networks and some generations, Bell Syst. Tech. J. 36 (1957) 1389-1401.
15. R.C. Read, R.E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks 5 (1975) 237-252.
16. A. Shioura, A. Tamura, Efficiently scanning all spanning trees of an undirected graph, Journal of Operations Research Society of Japan 38 (1995) 331-343.
17. A. Shioura, A. Tamura, T. Uno, An optimal algorithm for scanning all spanning trees of undirected graphs, SIAM Journal on Computing 26 (1997) 678-692.
18. R.E. Tarjan, Data structures and networks algorithms, in: CBMS Regional Conference, SIAM, Philadelphia, 1983.
19. J. Ward, The structure of efficients sets for convex objectives, Mathematics of Operations Research 14 (2) (1989) 249-257.