{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T20:52:08Z","timestamp":1770324728100,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf02032304","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T17:30:56Z","timestamp":1123867856000},"page":"209-230","source":"Crossref","is-referenced-by-count":104,"title":["On spanning tree problems with multiple objectives"],"prefix":"10.1007","volume":"52","author":[{"given":"Horst W.","family":"Hamacher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnter","family":"Ruhe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02032304_CR1","unstructured":"R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, 1993)."},{"key":"BF02032304_CR2","unstructured":"P.M. Camerini, G. Galbiati and F. Maffioli, The complexity of weighted multi-constrained spanning tree problems,Colloquium on the Theory of Algorithms, Pecs (1984)."},{"key":"BF02032304_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(93)90043-N","volume":"42","author":"S. Chung","year":"1993","unstructured":"S. Chung, H.W. Hamacher, F. Maffioli and K.G. Murty, A note on combinatorial optimization with max-linear objective functions, Discr. Appl. Math. 42 (1993) 139\u2013145.","journal-title":"Discr. Appl. Math."},{"key":"BF02032304_CR4","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF00938448","volume":"45","author":"H.W. Corley","year":"1985","unstructured":"H.W. Corley, Efficient spanning trees, J. Optim. Theory Appl. 45 (1985) 481\u2013485.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02032304_CR5","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1080\/07408178408974693","volume":"16","author":"Z. Drezner","year":"1984","unstructured":"Z. Drezner and S.Y. Nof, On optimizing bin packing and insertion plans for assembly robots, IEE Trans. 16 (1984) 262\u2013270.","journal-title":"IEE Trans."},{"key":"BF02032304_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1137\/0206011","volume":"6","author":"H.N. Gabow","year":"1977","unstructured":"H.N. Gabow, Two algorithms for generating weighted spanning trees in order, SIAM J. Comp. 6 (1977) 139\u2013150.","journal-title":"SIAM J. Comp."},{"key":"BF02032304_CR7","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0022-247X(68)90201-1","volume":"22","author":"A.M. Geoffrion","year":"1968","unstructured":"A.M. Geoffrion, Proper efficiency and the theory of vector optimization, J. Math. Anal. Appl. 22 (1968) 618\u2013630.","journal-title":"J. Math. Anal. Appl."},{"key":"BF02032304_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0377-2217(92)90317-3","volume":"56","author":"F. Glover","year":"1992","unstructured":"F. Glover, D. Klingman, R. Krishnan and R. Padman, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, Eur. J. Oper. Res. 56 (1992) 343\u2013356.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02032304_CR9","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"R.E. Gomory and T.C. Hu, Multiterminal network flows, SIAM J. Appl. Math. 9 (1961) 551\u2013571.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02032304_CR10","unstructured":"H.W. Hamacher and C. H\u00fcsselmann, Ranking approach to max-ordering combinatorial optimization and network flows, Report Nr. 246, Fachbereich Mathematik, Universit\u00e4t Kaiserslautern (1993)."},{"key":"BF02032304_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02022039","volume":"4","author":"H.W. Hamacher","year":"1985","unstructured":"H.W. Hamacher and M. Queyranne,K best solutions to combinatorial optimization problems, Ann. Oper. Res. 4 (1985) 123\u2013143.","journal-title":"Ann. Oper. Res."},{"key":"BF02032304_CR12","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R.M. Karp, The traveling salesman problem and minimum spanning trees, Oper. Res. 18 (1970) 1138\u20131162.","journal-title":"Oper. Res."},{"key":"BF02032304_CR13","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/0210017","volume":"10","author":"N. Katoh","year":"1981","unstructured":"N. Katoh, T. Ibaraki and H. Mine, An algorithm for findingk minimum spanning trees, SIAM J. Comp. 10 (1981) 247\u2013255.","journal-title":"SIAM J. Comp."},{"key":"BF02032304_CR14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. AMS 7 (1956) 48\u201350.","journal-title":"Proc. AMS"},{"key":"BF02032304_CR15","unstructured":"U. Lebrecht, Max-Lineare Zuordnungsprobleme in der Roboteroptimierung, Diplomarbeit, Universit\u00e4t Kaiserslautern, Fachbereich Mathematik (1991)."},{"key":"BF02032304_CR16","unstructured":"S. Nickel, private communication (1992)."},{"key":"BF02032304_CR17","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim, Shortest connection networks and some generalizations, Bell Syst. Techn. J. 36 (1957) 1389\u20131401.","journal-title":"Bell Syst. Techn. J."},{"key":"BF02032304_CR18","unstructured":"G. Righini and A. Colorni, Max-linear combinatorial optimization, Politecnico di Milano, Dipartimento d. Elettronica, report n. 91.005 (1991)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02032304.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02032304\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02032304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T11:57:40Z","timestamp":1557835060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02032304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF02032304"],"URL":"https:\/\/doi.org\/10.1007\/bf02032304","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}