{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T18:29:27Z","timestamp":1770488967871,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0377-2217(97)00391-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:18:16Z","timestamp":1027603096000},"page":"617-628","source":"Crossref","is-referenced-by-count":61,"title":["The problem of the optimal biobjective spanning tree"],"prefix":"10.1016","volume":"111","author":[{"given":"R.M.","family":"Ramos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Alonso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Sicilia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00391-3_BIB1","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02288325","article-title":"Algorithm for finding optimum trees: Description, use and evaluation","volume":"13","author":"Camerini","year":"1988","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB3","first-page":"26","article-title":"Collected papers","volume":"13","author":"Cayley","year":"1987","journal-title":"Quarterly Journal of Mathematics"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207217308938409","article-title":"Computer generation of directed trees and complete trees","volume":"34","author":"Chen","year":"1973","journal-title":"International Journal of Electronics"},{"issue":"3","key":"10.1016\/S0377-2217(97)00391-3_BIB5","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF00938448","article-title":"Efficient spanning trees","volume":"45","author":"Corley","year":"1985","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB6","unstructured":"R. Fletcher, Practical Methods of Optimization, vols. 1 and 2, Wiley, New York, 1987"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB7","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/0207024","article-title":"Finding all spanning trees of directed and undirected graphs","volume":"7","author":"Gabow","year":"1978","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.1016\/S0377-2217(97)00391-3_BIB8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","article-title":"On the history of the minimum spanning tree problem","volume":"7","author":"Graham","year":"1985","journal-title":"Annals of the History of Computing"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02032304","article-title":"On spanning tree problems with multiple objectives","volume":"52","author":"Hammacker","year":"1994","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/S009753979225030X","article-title":"Algorithms for enumerating all spanning tree of undirected and weighted graphs","volume":"24","author":"Kapoor","year":"1995","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB11","doi-asserted-by":"crossref","unstructured":"G. Kirchhoff, \u00dcber die Aufl\u00f6sung der Gleichungen, anf welche man bei der Untersuchung der Linearen Verteilung Galvanisher Str\u00f6me Gef\u00fchrt Wird, Poggendorg's Annalen der Physik and Chemie 72 (1847) 497\u2013508","DOI":"10.1002\/andp.18471481202"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning tree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proceedings of American Mathematical Society"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB13","first-page":"101","article-title":"Generation of complete trees","volume":"CT 15","author":"Mayeda","year":"1968","journal-title":"IEEE Transaction"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB14","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/S0377-2217(97)00391-3_BIB15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","article-title":"Bounds on backtrack algorithms for listing cycles, paths, and spanning trees","volume":"5","author":"Read","year":"1975","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.15807\/jorsj.38.331","article-title":"Efficiently scanning all spanning trees of an undirected graph","volume":"38","author":"Shioura","year":"1995","journal-title":"Journal of Operations Research Society of Japan"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB17","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1137\/S0097539794270881","article-title":"An optimal algorithm for scanning all spanning trees of undirected graphs","volume":"26","author":"Shioura","year":"1997","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB18","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, Data structures and networks algorithms, in: CBMS Regional Conference, SIAM, Philadelphia, 1983","DOI":"10.1137\/1.9781611970265"},{"key":"10.1016\/S0377-2217(97)00391-3_BIB19","doi-asserted-by":"crossref","unstructured":"J. Ward, The structure of efficients sets for convex objectives, Mathematics of Operations Research 14 (2) (1989) 249\u2013257.","DOI":"10.1287\/moor.14.2.249"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003913?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003913?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T23:45:43Z","timestamp":1578872743000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0377221797003913"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00391-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}