{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:15:47Z","timestamp":1725988547530},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992525"},{"type":"electronic","value":"9783319992532"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99253-2_6","type":"book-chapter","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T06:14:41Z","timestamp":1534832081000},"page":"69-81","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems"],"prefix":"10.1007","author":[{"given":"Behrooz","family":"Ghasemishabankareh","sequence":"first","affiliation":[]},{"given":"Melih","family":"Ozlen","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,22]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.epsr.2016.08.026","volume":"142","author":"M Abdelaziz","year":"2017","unstructured":"Abdelaziz, M.: Distribution network reconfiguration using a genetic algorithm with varying population size. Electr. Power Syst. Res. 142, 9\u201311 (2017)","journal-title":"Electr. Power Syst. Res."},{"key":"6_CR2","first-page":"4","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications, pp. 4\u20136. Prentice Hall, Upper Saddle River (1993)"},{"issue":"12","key":"6_CR3","doi-asserted-by":"publisher","first-page":"10352","DOI":"10.1016\/j.eswa.2012.01.125","volume":"39","author":"G Aiello","year":"2012","unstructured":"Aiello, G., La Scalia, G., Enea, M.: A multi objective genetic algorithm for the facility layout problem based upon slicing structure encoding. Expert Syst. Appl. 39(12), 10352\u201310358 (2012)","journal-title":"Expert Syst. Appl."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tre.2017.11.002","volume":"109","author":"AS Amiri","year":"2018","unstructured":"Amiri, A.S., Torabi, S.A., Ghodsi, R.: An iterative approach for a bi-level competitive supply chain network design problem under foresight competition and variable coverage. Transp. Res. Part E: Logist. Transp. Rev. 109, 99\u2013114 (2018)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"2","key":"6_CR5","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3\u201318 (2011)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/net.20167","volume":"50","author":"DB Fontes","year":"2007","unstructured":"Fontes, D.B., Gon\u00e7alves, J.F.: Heuristic solutions for general concave minimum cost network flow problems. Networks 50(1), 67\u201376 (2007)","journal-title":"Networks"},{"key":"6_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-181-7","volume-title":"Network Models and Optimization: Multiobjective Genetic Algorithm Approach","author":"M Gen","year":"2008","unstructured":"Gen, M., Cheng, R., Lin, L.: Network Models and Optimization: Multiobjective Genetic Algorithm Approach. Springer, London (2008). \nhttps:\/\/doi.org\/10.1007\/978-1-84800-181-7"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3846\/16484142.2013.815134","volume":"29","author":"U Klan\u0161ek","year":"2014","unstructured":"Klan\u0161ek, U.: Solving the nonlinear discrete transportation problem by minlp optimization. Transport 29(1), 1\u201311 (2014)","journal-title":"Transport"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"314","DOI":"10.3846\/transport.2010.39","volume":"25","author":"U Klan\u0161ek","year":"2010","unstructured":"Klan\u0161ek, U., P\u0161under, M.: Solving the nonlinear transportation problem by global optimization. Transport 25(3), 314\u2013324 (2010)","journal-title":"Transport"},{"key":"6_CR11","unstructured":"Lastusilta, T., et al.: GAMS MINLP solver comparisons and some improvements to the AlphaECP algorithm. In: Process Design and Systems Engineering Laboratory, Department of Chemical Engineering Division for Natural Sciences and Technology, Abo Akademi University, Abo, Finland (2011)"},{"issue":"4\u20135","key":"6_CR12","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4\u20135), 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"5","key":"6_CR13","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1016\/j.asoc.2012.11.016","volume":"13","author":"M Lotfi","year":"2013","unstructured":"Lotfi, M., Tavakkoli-Moghaddam, R.: A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems. Appl. Soft Comput. 13(5), 2711\u20132726 (2013)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1287\/ijoc.3.4.307","volume":"3","author":"Z Michalewicz","year":"1991","unstructured":"Michalewicz, Z., Vignaux, G.A., Hobbs, M.: A nonstandard genetic algorithm for the nonlinear transportation problem. ORSA J. Comput. 3(4), 307\u2013316 (1991)","journal-title":"ORSA J. Comput."},{"key":"6_CR15","unstructured":"Reca, J., Mart\u00ednez, J., L\u00f3pez-Luque, R.: A new efficient bounding strategy applied to the heuristic optimization of the water distribution networks design. In: Congress on Numerical Methods in Engineering CMN (2017)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.cie.2016.03.010","volume":"96","author":"FG Tari","year":"2016","unstructured":"Tari, F.G., Hashemi, Z.: A priority based genetic algorithm for nonlinear transportation costs problems. Comput. Ind. Eng. 96, 86\u201395 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"6_CR17","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1137\/140978296","volume":"45","author":"LA Vegh","year":"2016","unstructured":"Vegh, L.A.: A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. SIAM J. Comput. 45(5), 1729\u20131761 (2016)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1021091110342","volume":"3","author":"T Westerlund","year":"2002","unstructured":"Westerlund, T., P\u00f6rn, R.: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim. Eng. 3(3), 253\u2013280 (2002)","journal-title":"Optim. Eng."},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.asoc.2016.10.022","volume":"52","author":"YH Zhang","year":"2017","unstructured":"Zhang, Y.H., Gong, Y.J., Gu, T.L., Li, Y., Zhang, J.: Flexible genetic algorithm: a simple and generic approach to node placement problems. Appl. Soft Comput. 52, 457\u2013470 (2017)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99253-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T06:18:54Z","timestamp":1534832334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99253-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992525","9783319992532"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99253-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}