{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:37:27Z","timestamp":1762623447298,"version":"3.40.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,27]],"date-time":"2012-11-27T00:00:00Z","timestamp":1353974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10732-012-9214-6","type":"journal-article","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T18:52:10Z","timestamp":1353955930000},"page":"1-33","source":"Crossref","is-referenced-by-count":9,"title":["Concave minimum cost network flow problems solved with a colony of ants"],"prefix":"10.1007","volume":"19","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":[[2012,11,27]]},"reference":[{"issue":"5","key":"9214_CR1","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1080\/03052150500100312","volume":"37","author":"MH Afshar","year":"2005","unstructured":"Afshar, M.H.: A new transition rule for ant colony optimization algorithms: application to pipe network optimization problems. Eng. Optim. 37(5), 525\u2013540 (2005)","journal-title":"Eng. Optim."},{"key":"9214_CR2","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Reddy, M.: Applications of network optimization. In: Network Models, volume 7 of Handbooks in Operations Research and Management Science, pp. 1\u201383 (1995)","DOI":"10.1016\/S0927-0507(05)80118-5"},{"key":"9214_CR3","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":"9214_CR4","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.29.3.448","volume":"29","author":"F Barr","year":"1981","unstructured":"Barr, F., Glover, F., Klingman, D.: A new optimization method for fixed charge transportation problems. Oper. Res. 29, 448\u2013463 (1981)","journal-title":"Oper. Res."},{"key":"9214_CR5","unstructured":"Beasley, J.: Or-library. http:\/\/www.brunel.ac.uk\/deps\/ma\/research\/jeb\/orlib\/netflowccinfo.html (2010). Accessed Oct 2012"},{"key":"9214_CR6","unstructured":"Bernardino, E.M., Bernardino, A.M., S\u00e1nchez-P\u00e9rez, J.M., G\u00f3mez-Pulido, J.A., Vega-Rodr\u00edguez, M.A.: A hybrid ant colony optimization algorithm for solving the terminal assignment problem. In: IJCCI 2009\u2013International Joint Conference on, Computational Intelligence (2009)"},{"key":"9214_CR7","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":"9214_CR8","doi-asserted-by":"crossref","unstructured":"Bouhafs, L., Hajjam, A., Koukam, A.: A combination of simulated annealing and ant colony system for the capacitated location-routing problem. In: Knowledge-Based Intelligent Information and Engineering Systems, Lecture Notes in Computer Science, vol. 4251, pp. 409\u2013416 (2006)","DOI":"10.1007\/11892960_50"},{"key":"9214_CR9","doi-asserted-by":"crossref","unstructured":"Bui, T.N., Zrncic, C.M.: An ant-based algorithm for finding degree-constrained minimum spanning tree. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, GECCO \u201906, pp. 11\u201318, ACM, New York (2006)","DOI":"10.1145\/1143997.1144000"},{"key":"9214_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1008379621400","volume":"19","author":"RE Burkard","year":"2001","unstructured":"Burkard, R.E., Dollani, H., Thach, P.T.: Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. J. Glob. Optim. 19, 121\u2013139 (2001)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"9214_CR11","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/j.tre.2007.09.001","volume":"44","author":"CH Chen","year":"2008","unstructured":"Chen, C.H., Ting, C.J.: Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem. Transp. Res. E. 44(6), 1099\u20131122 (2008)","journal-title":"Transp. Res. E."},{"key":"9214_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TSMCC.2008.2001722","volume":"31","author":"WN Chen","year":"2009","unstructured":"Chen, W.N., Zhang, J.: Ant colony optimization approach to grid workflow scheduling problem with various QoS requirement. IEEE Trans. Syst. Man Cybern. C 31, 29\u201343 (2009)","journal-title":"IEEE Trans. Syst. Man Cybern. C"},{"key":"9214_CR13","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":"9214_CR14","doi-asserted-by":"crossref","unstructured":"Crawford, B., Castro, C.: Integrating lookahead and post processing procedures with ACO for solving set partitioning and covering problems. In: ICAISC, pp. 1082\u20131090 (2006)","DOI":"10.1007\/11785231_113"},{"key":"9214_CR15","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/978-0-387-30165-5_19","volume-title":"Handbook of Optimization in Telecommunications","author":"G Dahl","year":"2006","unstructured":"Dahl, G., Gouveia, L., Requejo, C.: On formulations and methods for the hop-constrained minimum spanning tree problem. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 493\u2013515. Springer, New York (2006)"},{"key":"9214_CR16","doi-asserted-by":"crossref","first-page":"699","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, 699\u2013708 (2011)","journal-title":"Neural Netw."},{"key":"9214_CR17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01417909","volume":"3","author":"JL Deneubourg","year":"1990","unstructured":"Deneubourg, J.L., Aron, S., Goss, S., Pasteels, J.M.: The self-organizing exploratory pattern of the Argentine ant. J. Insect Behav. 3, 159\u2013168 (1990)","journal-title":"J. Insect Behav."},{"key":"9214_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344, 243\u2013278 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9214_CR19","doi-asserted-by":"crossref","DOI":"10.1109\/CEC.1999.782657","volume-title":"The Ant Colony Optimization Meta-heuristic","author":"M Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G.: The Ant Colony Optimization Meta-heuristic. McGraw-Hill Ltd., UK, Maidenhead (1999)"},{"key":"9214_CR20","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)"},{"issue":"1","key":"9214_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"key":"9214_CR22","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/CEC.2006.1688292","volume-title":"Proceedings of the 2006 IEEE Congress on Evolutionary Computation","author":"J Faria","year":"2006","unstructured":"Faria, J., Silva, C., Sousa, J., Surico, M., Kaymak, U.: Distributed optimization using ant colony optimization in a concrete delivery supply chain. In: Yen, G.G., Lucas, S.M., Fogel, G., Kendall, G., Salomon, R., Zhang, B.T., Coello, C.A.C., Runarsson, T.P. (eds.) Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pp. 73\u201380. IEEE Press, Vancouver (2006)"},{"key":"9214_CR23","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"},{"issue":"4","key":"9214_CR24","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."},{"key":"9214_CR25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10898-005-1658-x","volume":"34","author":"DB Fontes","year":"2006","unstructured":"Fontes, D.B., Hadjiconstantinou, E., Christofides, N.: A branch-and-bound algorithm for concave network flow problems. J. Glob. Optim. 34, 127\u2013155 (2006a)","journal-title":"J. Glob. Optim."},{"key":"9214_CR26","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10898-005-1657-y","volume":"34","author":"DBMM Fontes","year":"2006","unstructured":"Fontes, D.B.M.M., Hadjiconstantinou, E., Christofides, N.: Lower bounds from state space relaxations for network routing problems. J. Glob. Optim. 34, 97\u2013125 (2006b)","journal-title":"J. Glob. Optim."},{"key":"9214_CR27","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/j.ejor.2005.03.024","volume":"174","author":"DBMM Fontes","year":"2006","unstructured":"Fontes, D.B.M.M., Hadjiconstantinou, E., Christofides, N.: A new dynamic programming approach for single-source uncapacitated concave minimum cost network flow problems. Eur. J. Oper. Res. 174, 1205\u20131219 (2006c)","journal-title":"Eur. J. Oper. Res."},{"key":"9214_CR28","first-page":"249","volume":"4","author":"G Gallo","year":"1980","unstructured":"Gallo, G., Sandi, C., Sodini, C.: An algorithm for the min concave cost flow problem. Euro. 4, 249\u2013255 (1980)","journal-title":"Euro."},{"issue":"1","key":"9214_CR29","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":"9214_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/b137269","volume-title":"Supply Chain Optimization","author":"J Geunes","year":"2005","unstructured":"Geunes, J., Pardalos, P.: Supply Chain Optimization. Springer, Berlin (2005)"},{"key":"9214_CR31","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF00462870","volume":"76","author":"S Goss","year":"1989","unstructured":"Goss, S., Aron, S., Deneubourg, J., Pasteels, J.: Self-organized shortcuts in the Argentine ant. Naturwissenschaften. 76, 579\u2013581 (1989)","journal-title":"Naturwissenschaften."},{"key":"9214_CR32","first-page":"506","volume-title":"Handbook of Global Optimization","author":"GM Guisewite","year":"1995","unstructured":"Guisewite, G.M.: Network problems. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 506\u2013648. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"9214_CR33","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00119934","volume":"3","author":"G Guisewite","year":"1991","unstructured":"Guisewite, G., Pardalos, P.: Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. J. Glob. Optim. 3, 245\u2013265 (1991)","journal-title":"J. Glob. Optim."},{"key":"9214_CR34","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.3230230208","volume":"23","author":"GM Guisewite","year":"1993","unstructured":"Guisewite, G.M., Pardalos, P.M.: A polynomial time solvable concave network flow problem. Networks. 23, 143\u2013147 (1993)","journal-title":"Networks."},{"key":"9214_CR35","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/net.3230190304","volume":"19","author":"D Hochbaum","year":"1989","unstructured":"Hochbaum, D., Segev, A.: Analysis of a flow problem with fixed charges. Networks. 19, 291\u2013312 (1989)","journal-title":"Networks."},{"key":"9214_CR36","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01545530","volume":"20","author":"R Horst","year":"1998","unstructured":"Horst, R., Thoai, N.V.: An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks. OR Spektrum. 20, 47\u201353 (1998)","journal-title":"OR Spektrum."},{"key":"9214_CR37","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2174\/092986608784567465","volume":"15","author":"XM Hu","year":"2008","unstructured":"Hu, X.M., Zhang, J., Xiao, J., Li, Y.: Protein folding in hydrophobic-polar lattice model: a flexible ant-colony optimization approach. Protein Pept. Lett. 15, 469\u2013477 (2008)","journal-title":"Protein Pept. Lett."},{"key":"9214_CR38","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","volume":"22","author":"J Kennington","year":"1976","unstructured":"Kennington, J., Unger, V.: A new branch-and-bound algorithm for the fixed charge transportation problem. Manag. Sci. 22, 1116\u20131126 (1976)","journal-title":"Manag. Sci."},{"key":"9214_CR39","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.3.CO;2-5","volume":"35","author":"D Kim","year":"1999","unstructured":"Kim, D., Pardalos, P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Networks. 35, 216\u2013222 (1999)","journal-title":"Networks."},{"issue":"3","key":"9214_CR40","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E","volume":"35","author":"D Kim","year":"2000","unstructured":"Kim, D., Pardalos, P.: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. Networks. 35(3), 216\u2013222 (2000)","journal-title":"Networks."},{"key":"9214_CR41","doi-asserted-by":"crossref","unstructured":"Klinz, B., Tuy, H.: Minimum concave cost network flow problem with a single nonlinear arc cost. In: Du, D.Z., Pardalos, P.M. (eds.) Network Optimization Problems, pp. 125\u2013143. World Scientific, Singapore (1993)","DOI":"10.1142\/9789812798190_0008"},{"key":"9214_CR42","doi-asserted-by":"crossref","unstructured":"Lamar, B.W.: A method for solving network flow problems with general nonlinear arc costs. In: Network Optimization Problems: Algorithms Applications and Complexity, pp. 147\u2013167. World Scientific, Singapore (1993)","DOI":"10.1142\/9789812798190_0009"},{"key":"9214_CR43","doi-asserted-by":"crossref","unstructured":"Lessing, L., Dumitrescu, I., St\u00fctzle, T.: A comparison between ACO algorithms for the set covering problem. In: ANTS, pp. 1\u201312 (2004).","DOI":"10.1007\/978-3-540-28646-2_1"},{"key":"9214_CR44","first-page":"823","volume":"3","author":"S Meshoul","year":"2002","unstructured":"Meshoul, S., Batouche, M.: Ant colony system with extremal dynamics for point matching and pose estimation. In: 16th International Conference on. Pattern Recognition 3, 823\u2013826 (2002)","journal-title":"Pattern Recognition"},{"key":"9214_CR45","first-page":"139","volume-title":"GECCO","author":"MSR Monteiro","year":"2011","unstructured":"Monteiro, M.S.R., Fontes, D.B.M.M., Fontes, F.A.C.C.: An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions. In: Krasnogor, N., Lanzi, P.L. (eds.) GECCO, pp. 139\u2013146. ACM, New York (2011)"},{"key":"9214_CR46","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":"9214_CR47","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"A Nahapetyan","year":"2008","unstructured":"Nahapetyan, A., Pardalos, P.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39, 37\u201350 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"9214_CR48","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F Ortega","year":"2003","unstructured":"Ortega, F., Wolsey, L.A.: A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks. 41, 143\u2013158 (2003)","journal-title":"Networks."},{"issue":"9","key":"9214_CR49","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"US Palekar","year":"1990","unstructured":"Palekar, U.S., Karwan, M.H., Zionts, S.: A branch-and-bound method for the fixed charge transportation problem. Manag. Sci. 36(9), 1092\u20131105 (1990)","journal-title":"Manag. Sci."},{"key":"9214_CR50","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/TEVC.2002.802452","volume":"6","author":"RS Parpinelli","year":"2002","unstructured":"Parpinelli, R.S., Lopes, H.S., Freitas, A.A.: Data mining with an ant colony optimization algorithm. IEEE Trans. Evol. Comput. 6, 321\u2013332 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9214_CR51","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":"9214_CR52","doi-asserted-by":"crossref","unstructured":"Rappos, E., Hadjiconstantinou, E.: An ant colony heuristic for the design of two-edge connected flow networks. In: ANTS, Workshop, pp. 270\u2013277 (2004)","DOI":"10.1007\/978-3-540-28646-2_24"},{"key":"9214_CR53","doi-asserted-by":"crossref","unstructured":"Rardin, R.L., Uzsoy, R.: Experimental evaluation of heuristic optimization algorithms: a tutorial. J. Heuristics 7, 261\u2013304 (2001)","DOI":"10.1023\/A:1011319115230"},{"key":"9214_CR54","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11590-009-0114-0","volume":"3","author":"S Rebennack","year":"2009","unstructured":"Rebennack, S., Nahapetyan, A., Pardalos, P.: Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3, 347\u2013355 (2009)","journal-title":"Optim. Lett."},{"key":"9214_CR55","doi-asserted-by":"crossref","first-page":"1794","DOI":"10.1016\/j.cor.2004.11.019","volume":"33","author":"M Reimann","year":"2006","unstructured":"Reimann, M., Laumanns, M.: Savings based ant colony optimization for the capacitated minimum spanning tree problem. Comput. Oper. Res. 33, 1794\u20131822 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9214_CR56","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1016\/j.cor.2004.11.026","volume":"33","author":"SJ Shyu","year":"2006","unstructured":"Shyu, S.J., Lin, B.M.T., Hsiao, T.S.: Ant colony optimization for the cell assignment problem in PCS networks. Comput. Oper. Res. 33(6), 1713\u20131740 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9214_CR57","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0377-2217(98)00385-3","volume":"120","author":"DK Smith","year":"2000","unstructured":"Smith, D.K., Walters, G.A.: An evolutionary approach for finding optimal trees in undirected networks. Eur. J. Oper. Res. 120(3), 593\u2013602 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9214_CR58","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","volume":"22","author":"RM Soland","year":"1974","unstructured":"Soland, R.M.: Optimal facility location with concave costs. Oper. Res. 22, 373\u2013382 (1974)","journal-title":"Oper. Res."},{"key":"9214_CR59","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 Computation (ICEC\u201997). IEEE Press, Piscataway, pp. 309\u2013314 (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"key":"9214_CR60","first-page":"209","volume":"25","author":"H Tuy","year":"2000","unstructured":"Tuy, H.: Strong polynomial-time solvability of a minimum concave cost network flow problem. Acta Math. Vietnam. 25, 209\u2013217 (2000)","journal-title":"Acta Math. Vietnam."},{"key":"9214_CR61","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/11839088_32","volume-title":"Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Science","author":"H Venables","year":"2006","unstructured":"Venables, H., Moscardini, A.: An adaptive search heuristic for the capacitated fixed charge location problem. In: Dorigo, M., Gambardella, L., Birattari, M., Martinoli, A., Poli, R., St\u00fctzle, T. (eds.) Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Science, vol. 4150, pp. 348\u2013355. Springer, Berlin (2006)"},{"key":"9214_CR62","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1287\/mnsc.5.3.304","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner, H.M.: On a class of capacitated transportation problems. Manag. Sci. 5, 304\u2013318 (1958)","journal-title":"Manag. Sci."},{"key":"9214_CR63","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."},{"key":"9214_CR64","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","volume":"14","author":"W Zangwill","year":"1968","unstructured":"Zangwill, W.: Minimum concave cost flows in certain networks. Manag. Sci. 14, 429\u2013450 (1968)","journal-title":"Manag. Sci."},{"key":"9214_CR65","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPEL.2008.2006175","volume":"24","author":"J Zhang","year":"2009","unstructured":"Zhang, J., Chung, H., Lo, W.L., Huang, T.: Extended ant colony optimization algorithm for power electronic circuit design. IEEE Trans. Power Electron. 24, 147\u2013162 (2009)","journal-title":"IEEE Trans. Power Electron."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9214-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-012-9214-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9214-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T21:12:37Z","timestamp":1745356357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-012-9214-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,27]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9214"],"URL":"https:\/\/doi.org\/10.1007\/s10732-012-9214-6","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2012,11,27]]}}}