{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:51:55Z","timestamp":1758268315232,"version":"3.40.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,28]],"date-time":"2014-06-28T00:00:00Z","timestamp":1403913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11590-014-0762-6","type":"journal-article","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T18:54:57Z","timestamp":1403895297000},"page":"451-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach"],"prefix":"10.1007","volume":"9","author":[{"given":"Marta S. R.","family":"Monteiro","sequence":"first","affiliation":[]},{"given":"Dalila B. M. M.","family":"Fontes","sequence":"additional","affiliation":[]},{"given":"Fernando A. C. C.","family":"Fontes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,28]]},"reference":[{"key":"762_CR1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.ejor.2011.01.051","volume":"212","author":"I Akgun","year":"2011","unstructured":"Akgun, I., Tansel, B.C.: New formulations of the hop-constrained minimum spanning tree problem via miller-tucker-zemlin constraints. Eur. J. Oper. Res. 212, 263\u2013276 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"762_CR2","unstructured":"Altiparmak, F., Karaoglan, I.: A genetic ant colony optimization approach for concave cost transportation problems. In: IEEE Congress on Evolutionary Computation, 2007. CEC 2007, pp. 1685\u20131692 (2007)."},{"key":"762_CR3","unstructured":"Beasley, J.: Or-library. http:\/\/www.brunel.ac.uk\/deps\/ma\/research\/jeb\/orlib\/netflowccinfo.html (2010)"},{"key":"762_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"Y Bin","year":"2009","unstructured":"Bin, Y., Zhong-Zhen, Y., Baozhen, Y.: An improved ant colony optimization for vehicle routing problem. Eur. J. Oper. Res. 196, 171\u2013176 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"762_CR5","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Dell\u2019Amico, M., Martello, S.: Assignment problems. Siam (2009).","DOI":"10.1137\/1.9780898717754"},{"key":"762_CR6","first-page":"141","volume":"9","author":"O Cordon","year":"2002","unstructured":"Cordon, O., Herrera, F., St\u00fctzle, T.: A review on the ant colony optimization metaheuristic: basis, models and new trends. Mathw. Soft. Comput. 9, 141\u2013175 (2002)","journal-title":"Mathw. Soft. Comput."},{"key":"762_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.neunet.2011.03.018","volume":"24","author":"C Dang","year":"2011","unstructured":"Dang, C., Sun, Y., Wang, Y., Yang, Y.: A deterministic annealing algorithm for the minimum concave cost network flow problem. Neural Netw. 24, 69\u2013708 (2011)","journal-title":"Neural Netw."},{"key":"762_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant colony optimization. MIT Press, Cambridge (2004)"},{"key":"762_CR9","first-page":"13","volume":"48","author":"DBMM Fontes","year":"2010","unstructured":"Fontes, D.B.M.M.: Optimal hop-constrained trees for nonlinear cost flow networks. INFOR 48, 13\u201321 (2010)","journal-title":"INFOR"},{"key":"762_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/net.20167","volume":"50","author":"DBMM Fontes","year":"2007","unstructured":"Fontes, D.B.M.M., Gon\u00e7alves, J.F.: Heuristic solutions for general concave minimum cost network flow problems. Networks 50, 67\u201376 (2007)","journal-title":"Networks"},{"key":"762_CR11","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1007\/s11590-012-0505-5","volume":"7","author":"DBMM Fontes","year":"2012","unstructured":"Fontes, D.B.M.M., Gon\u00e7alves, J.F.: A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks. Optim. Lett. 7, 1303\u20131324 (2012)","journal-title":"Optim. Lett."},{"issue":"4","key":"762_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.10076","volume":"41","author":"DBMM Fontes","year":"2003","unstructured":"Fontes, D.B.M.M., Hadjiconstantinou, E., Christofides, N.: Upper bounds for single-source uncapacitated concave minimum-cost network flow problems. Networks 41(4), 221\u2013228 (2003)","journal-title":"Networks"},{"issue":"1","key":"762_CR13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C Garc\u00eda-Mart\u00ednez","year":"2007","unstructured":"Garc\u00eda-Mart\u00ednez, C., Cord\u00f3n, O., Herrera, F.: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. Eur. J. Oper. Res. 180(1), 116\u2013148 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"762_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1018911003529","volume":"86","author":"L Gouveia","year":"1999","unstructured":"Gouveia, L., Martins, P.: The capacitated minimal spanning tree problem: an experiment with a hop-indexed model. Ann. Oper. Res. 86, 271\u2013294 (1999)","journal-title":"Ann. Oper. Res."},{"key":"762_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10732-009-9123-5","volume":"17","author":"L Gouveia","year":"2011","unstructured":"Gouveia, L., Paias, A., Sharma, D.: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. J. Heuristics 17, 23\u201337 (2011a)","journal-title":"J. Heuristics"},{"key":"762_CR16","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0377-2217(00)00143-0","volume":"132","author":"L Gouveia","year":"2001","unstructured":"Gouveia, L., Requejo, C.: A new lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Eur. J. Oper. Res. 132, 539\u2013552 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"762_CR17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-009-0297-2","volume":"128","author":"L Gouveia","year":"2011","unstructured":"Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as steiner tree problems over layered graphs. Math. Prog. 128, 123\u2013148 (2011b)","journal-title":"Math. Prog."},{"key":"762_CR18","volume-title":"Encyclopedia of Optimization","author":"D Kim","year":"2003","unstructured":"Kim, D.: Piecewise linear network flow problems. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization. Kluwer Academic, Dordrechtr (2003)"},{"key":"762_CR19","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/j.amc.2012.06.078","volume":"219","author":"MS Kiran","year":"2012","unstructured":"Kiran, M.S., Gunduz, M., Baykan, O.K.: A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum. Appl. Math. Comput. 219, 1515\u20131521 (2012)","journal-title":"Appl. Math. Comput."},{"key":"762_CR20","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1016\/j.amc.2012.09.064","volume":"219","author":"TW Liao","year":"2012","unstructured":"Liao, T.W., Kuo, R.J., Hu, J.T.L.: Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems. Appl. Math. Comput. 219, 3241\u20133252 (2012)","journal-title":"Appl. Math. Comput."},{"key":"762_CR21","unstructured":"Monteiro, M.S.R.: Ant colony optimization algorithms to solve nonlinear network flow problems. Ph.D. thesis, Faculdade de Economia da Universidade do Porto, Porto, Portugal (2012)"},{"key":"762_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-012-9214-6","volume":"19","author":"MSR Monteiro","year":"2013","unstructured":"Monteiro, M.S.R., Fontes, D.B.M.M., Fontes, F.A.C.C.: Concave minimum cost network flow problems solved with a colony of ants. J. Heuristics 19, 1\u201333 (2013a)","journal-title":"J. Heuristics"},{"key":"762_CR23","unstructured":"Monteiro, M.S.R., Fontes, D.B.M.M., Fontes, F.A.C.C.: Solving hop-constrained MST problems with ACO. Working paper, N493, Universidade do Porto, Faculdade de Economia (2013b)"},{"key":"762_CR24","doi-asserted-by":"crossref","first-page":"9608","DOI":"10.1016\/j.eswa.2009.01.020","volume":"36","author":"R Mullen","year":"2009","unstructured":"Mullen, R., Monekosso, D., Barman, S., Remagnino, P.: A review of ant algorithms. Expert. Syst. Appl. 36, 9608\u20139617 (2009)","journal-title":"Expert. Syst. Appl."},{"key":"762_CR25","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1111\/j.1467-8667.2010.00715.x","volume":"27","author":"R Putha","year":"2012","unstructured":"Putha, R., Quadrifoglio, L., Zechman, E.: Comparing ant colony optimization and genetic algorithm approaches for solving traffic signal coordination under oversaturation conditions. Comput-Aided Civ. Infrastruct. Eng. 27, 14\u201328 (2012)","journal-title":"Comput-Aided Civ. Infrastruct. Eng."},{"key":"762_CR26","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.: Max-min ant system and local search for the traveling salesman problem. In: IEEE International Conference On Evolutionary Cmputation (ICEC\u201997), pp. 309\u2013314. IEEE Press, Piscataway (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"key":"762_CR27","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1016\/j.eswa.2007.08.018","volume":"35","author":"S Tseng","year":"2008","unstructured":"Tseng, S., Lin, C., Huang, Y.: Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints. Expert. Syst. Appl. 35, 1473\u20131481 (2008)","journal-title":"Expert. Syst. Appl."},{"key":"762_CR28","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.jnca.2008.03.002","volume":"32","author":"H Wang","year":"2008","unstructured":"Wang, H., Shi, Z., Li, S.: Multicast routing for delay variation bound using a modified ant colony algorithm. J. Netw. Comput. Appl. 32, 258\u2013272 (2008)","journal-title":"J. Netw. Comput. Appl."},{"key":"762_CR29","doi-asserted-by":"crossref","first-page":"1438","DOI":"10.1016\/j.amc.2005.05.042","volume":"174","author":"PY Yin","year":"2006","unstructured":"Yin, P.Y., Wang, J.Y.: Ant colony optimization for the nonlinear resource allocation problem. Appl. Math. Comput. 174, 1438\u20131453 (2006)","journal-title":"Appl. Math. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0762-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0762-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0762-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T13:54:22Z","timestamp":1746280462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0762-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,28]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["762"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0762-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2014,6,28]]}}}