{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T11:58:09Z","timestamp":1716379089530},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,9]],"date-time":"2013-03-09T00:00:00Z","timestamp":1362787200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s10288-013-0229-0","type":"journal-article","created":{"date-parts":[[2013,3,8]],"date-time":"2013-03-08T11:29:54Z","timestamp":1362742194000},"page":"275-294","source":"Crossref","is-referenced-by-count":2,"title":["Bicriteria path problem minimizing the cost and minimizing the number of labels"],"prefix":"10.1007","volume":"11","author":[{"given":"Marta","family":"Pascoal","sequence":"first","affiliation":[]},{"given":"M. Eug\u00e9nia","family":"Captivo","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Cl\u00edmaco","sequence":"additional","affiliation":[]},{"given":"Ana","family":"Laranjeira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,9]]},"reference":[{"key":"229_CR1","volume-title":"Network flows: theory, algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs"},{"key":"229_CR2","doi-asserted-by":"crossref","first-page":"1969","DOI":"10.1016\/j.cor.2011.09.006","volume":"39","author":"C Bornstein","year":"2012","unstructured":"Bornstein C, Maculan N, Pascoal M, Pinto L (2012) Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization. Comput Oper Res 39:1969\u20131976","journal-title":"Comput Oper Res"},{"issue":"5","key":"229_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"R Chang","year":"1997","unstructured":"Chang R, Leu S-J (1997) The minimum labeling spanning trees. Inf Process Lett 63(5):277\u2013282","journal-title":"Inf Process Lett"},{"key":"229_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","volume":"11","author":"J Cl\u00edmaco","year":"1982","unstructured":"Cl\u00edmaco J, Martins E (1982) A bicriterion shortest path algorithm. Eur J Oper Res 11:399\u2013404","journal-title":"Eur J Oper Res"},{"key":"229_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1111\/j.1475-3995.2011.00815.x","volume":"19","author":"J Cl\u00edmaco","year":"2012","unstructured":"Cl\u00edmaco J, Pascoal M (2012) Multicriteria path and tree problems: discussion on exact algorithms and applications. Int Trans Oper Res 19:63\u201398","journal-title":"Int Trans Oper Res"},{"key":"229_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ejor.2009.10.013","volume":"204","author":"J Cl\u00edmaco","year":"2010","unstructured":"Cl\u00edmaco J, Captivo ME, Pascoal M (2010) On the bicriterion-minimal cost\/minimal label-spanning tree problem. Eur J Oper Res 204:199\u2013205","journal-title":"Eur J Oper Res"},{"key":"229_CR7","unstructured":"Consoli S, Moreno JA, Mladenovi\u0107 N, Darby-Dowman K (2006) Constructive heuristics for the minimum labelling spanning tree problem: a preliminary comparison. Technical Report DEIOC-4, Universidad de La Laguna, La Laguna, September http:\/\/hdl.handle.net\/2438\/504"},{"key":"229_CR8","doi-asserted-by":"crossref","unstructured":"Hansen P (1980) Bicriterion path problems. In: Fandel G, Gal T (eds) Multiple criteria decision making: theory and applications. Lectures notes in economics and mathematical systems","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"229_CR9","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1016\/j.ejor.2010.06.035","volume":"207","author":"M Iori","year":"2010","unstructured":"Iori M, Martello S, Pretolani D (2010) An aggregate label setting policy for the multi-objective shortest path problem. Eur J Oper Res 207:1489\u20131496","journal-title":"Eur J Oper Res"},{"key":"229_CR10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J Kruskal","year":"1956","unstructured":"Kruskal J (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7:48\u201350","journal-title":"Proc Am Math Soc"},{"key":"229_CR11","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R Prim","year":"1957","unstructured":"Prim R (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"229_CR12","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith A, Ehrgott M (2009) A comparison of solution strategies for biobjective shortest path problems. Comput Oper Res 36:1299\u20131331","journal-title":"Comput Oper Res"},{"key":"229_CR13","volume-title":"Multiple criteria optimization theory, computation and application","author":"R Steuer","year":"1986","unstructured":"Steuer R (1986) Multiple criteria optimization theory, computation and application. Wiley, New York"},{"key":"229_CR14","volume-title":"Design of multimodal transport networks: a hierarchical approach","author":"R Van-Nes","year":"2002","unstructured":"Van-Nes R (2002) Design of multimodal transport networks: a hierarchical approach. Delft University Press, Delft"},{"key":"229_CR15","first-page":"425","volume":"16","author":"P Vincke","year":"1974","unstructured":"Vincke P (1974) Probl\u00e8mes multicrit\u00e8res. Cahiers du Centre d\u2019\u00c9tudes de Recherche Op\u00e9rationelle 16:425\u2013439","journal-title":"Cahiers du Centre d\u2019\u00c9tudes de Recherche Op\u00e9rationelle"},{"key":"229_CR16","unstructured":"Wirth H-C (2001) Multicriteria approximation of network design and network upgrade problems. PhD thesis, University of W\u00fcrzburg"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0229-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-013-0229-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0229-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:58Z","timestamp":1559131978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-013-0229-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,9]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["229"],"URL":"https:\/\/doi.org\/10.1007\/s10288-013-0229-0","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,9]]}}}