{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T16:50:51Z","timestamp":1652287851756},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10479-017-2667-0","type":"journal-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T13:20:32Z","timestamp":1507900832000},"page":"353-377","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem"],"prefix":"10.1007","volume":"267","author":[{"given":"Hela","family":"Masri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saoussen","family":"Krichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,13]]},"reference":[{"key":"2667_CR1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.endm.2014.11.025","volume":"47","author":"Ons Abdelkhalek","year":"2015","unstructured":"Abdelkhalek, Ons, Masri, Hela, & Krichen, Saoussen. (2015). An adaptive variable neighborhood search for solving the multi-objective node placement problem. Electronic Notes in Discrete Mathematics, 47, 189\u2013196.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2667_CR2","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs, NJ: Prentice-Hall."},{"issue":"1","key":"2667_CR3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ejor.2010.08.005","volume":"208","author":"A Amiria","year":"2001","unstructured":"Amiria, A., & Barkhic, R. (2001). The combinatorial bandwidth packing problem. European Journal of Operational Research, 208(1), 37\u201345.","journal-title":"European Journal of Operational Research"},{"key":"2667_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"AA Assad","year":"1978","unstructured":"Assad, A. A. (1978). Multicommodity network flows\u2014A survey. Networks, 8, 37\u201391.","journal-title":"Networks"},{"key":"2667_CR5","doi-asserted-by":"crossref","unstructured":"Baier, G., Kohler, E., & Skutella, M. (2002). On the k-splittable flow problem. In 10th annual european symposium on algorithms (pp. 101\u2013113).","DOI":"10.1007\/3-540-45749-6_13"},{"issue":"2","key":"2667_CR6","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C Barnhart","year":"2000","unstructured":"Barnhart, C., Hane, C. A., & Vance, P. H. (2000). Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research, 48(2), 318\u2013326.","journal-title":"Operations Research"},{"issue":"9","key":"2667_CR7","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1057\/jors.2009.86","volume":"61","author":"C Barnhart","year":"2010","unstructured":"Barnhart, C., Hane, C. A., & Vance, P. H. (2010). An ant colony optimization metaheuristic for single-path multicommodity network flow problems. Journal of the Operational Research Society, 61(9), 1340\u20131355.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"2667_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/JPROC.2006.887322","volume":"95","author":"M Chiang","year":"2007","unstructured":"Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007). Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of the IEEE, 95(1), 255\u2013312.","journal-title":"Proceedings of the IEEE"},{"key":"2667_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.eswa.2015.12.014","volume":"50","author":"C Contreras-Bolton","year":"2016","unstructured":"Contreras-Bolton, C., Gatica, G., Rey Barra, C., & Parada, V. (2016). A multi-operator genetic algorithm for the generalized minimum spanning tree problem. Expert Systems with Applications, 50, 1\u20138.","journal-title":"Expert Systems with Applications"},{"key":"2667_CR10","doi-asserted-by":"crossref","unstructured":"Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In Lecture notes in computer science (Vol. 1917, pp. 849\u2013858).","DOI":"10.1007\/3-540-45356-3_83"},{"issue":"2","key":"2667_CR11","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.ejor.2009.10.014","volume":"204","author":"X Delorme","year":"2010","unstructured":"Delorme, X., Gandibleux, X., & Degoutin, F. (2010). Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem. European Journal of Operational Research, 204(2), 206\u2013217.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"2667_CR12","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1016\/j.cor.2008.11.001","volume":"36","author":"A Eusbio","year":"2009","unstructured":"Eusbio, A., & Figueira, J. R. (2009). Finding non-dominated solutions in bi-objective integer network flow problems. Computers & Operations Research, 36(9), 2554\u20132564.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2667_CR13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ejor.2008.10.031","volume":"199","author":"A Eusbio","year":"2009","unstructured":"Eusbio, A., & Figueira, J. R. (2009). On the computation of all supported efficient solutions in multi-objective integer network flow problems. European Journal of Operational Research, 199(1), 68\u201376.","journal-title":"European Journal of Operational Research"},{"key":"2667_CR14","unstructured":"Geiger, M. J. (2004). Randomised Variable Neighbourhood Search for Multi Objective Optimisation. In Proceedings of EU\/ME workshop: Design and evaluation of advanced hybrid meta-heuristics (pp. 34\u201342)."},{"issue":"3","key":"2667_CR15","first-page":"296","volume":"1","author":"YY Haimes","year":"1971","unstructured":"Haimes, Y. Y., Lasdon, L. S., & Wismer, D. A. (1971). On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transaction on Systems, Man, and Cybernetics, 1(3), 296\u201329.","journal-title":"IEEE Transaction on Systems, Man, and Cybernetics"},{"issue":"3","key":"2667_CR16","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.tcs.2007.02.046","volume":"379","author":"A Hall","year":"2007","unstructured":"Hall, A., Hippler, S., & Skutella, M. (2007). Multicommodity flows over time: Efficient algorithms and complexity. Theoretical Computer Science, 379(3), 387\u2013404.","journal-title":"Theoretical Computer Science"},{"key":"2667_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G Handler","year":"1980","unstructured":"Handler, G., & Zang, I. (1980). A dual algorithm for the constrained shortest path problem. Networks, 10, 293\u2013310.","journal-title":"Networks"},{"issue":"1","key":"2667_CR18","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/ijoc.15.1.42.15151","volume":"15","author":"K Holmberg","year":"2003","unstructured":"Holmberg, K., & Yuan, D. (2003). A multicommodity network-flow problem with side constraints on paths solved by column generation. INFORMS Journal on Computing, 15(1), 42\u201357.","journal-title":"INFORMS Journal on Computing"},{"key":"2667_CR19","unstructured":"Kleinberg, J. M. (1996). Approximation algorithms for disjoint paths problems. Ph.D. thesis, MIT, Cambridge, MA."},{"key":"2667_CR20","unstructured":"Koch, R., Skutella, M., & Spenke, I. (2005). Approximation and complexity of k-splittable flows, approximation and online algorithms. In Third international workshop, WAOA (pp. 244\u2013257)."},{"issue":"18","key":"2667_CR21","doi-asserted-by":"crossref","first-page":"2246","DOI":"10.1016\/j.comcom.2010.07.029","volume":"33","author":"P Leesutthipornchai","year":"2010","unstructured":"Leesutthipornchai, P., Charnsripinyb, C., & Wattanapongsakorn, N. (2010). Solving multiobjective routing and wavelength assignment in WDM network using hybrid evolutionary computation approach. Computer Communications, 33(18), 2246\u20132259.","journal-title":"Computer Communications"},{"key":"2667_CR22","doi-asserted-by":"crossref","unstructured":"Masri, H., Krichen, S., & Guitouni, A. (2011). An ant colony optimization metaheuristic for solving bi-objective multi-sources multicommodity communication flow problem. In Proceeding of 4th joint IFIP wireless and mobile networking conference (WMNC) (pp. 1\u20138).","DOI":"10.1109\/WMNC.2011.6097256"},{"key":"2667_CR23","unstructured":"Masri, H., Krichen, S., & Guitouni, A. (2017). Metaheuristics for solving the bi-objective single path multicommodity communication flow problem. International Transactions in Operational Research, 1\u201326."},{"issue":"3","key":"2667_CR24","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1504\/IJBIDM.2014.068368","volume":"9","author":"H Masri","year":"2014","unstructured":"Masri, H., Krichen, S., & Guitouni, A. (2014). A metaheuristic for solving the unsplittable multicommodity flow problem: The maritime surveillance case. International Journal of Business Intelligence and Data Mining, 9(3), 254\u2013269.","journal-title":"International Journal of Business Intelligence and Data Mining"},{"key":"2667_CR25","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G. (2009). Effective implementation of the e-constraint method in multi-objective mathematical programming problems. Applied Mathematics and Computation, 213, 455\u2013465.","journal-title":"Applied Mathematics and Computation"},{"issue":"11","key":"2667_CR26","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"2667_CR27","unstructured":"Moradi, S. (2010). The bi-objective multi-commodity minimum cost flow problem. In Proceedings of the 45th annual conference of the ORSNZ (pp. 28\u201338)."},{"issue":"2","key":"2667_CR28","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ejor.2015.01.021","volume":"244","author":"S Moradi","year":"2015","unstructured":"Moradi, S., Raith, A., & Ehrgott, M. (2015). A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem. European Journal of Operational Research, 244(2), 369\u2013378.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2667_CR29","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/mnsc.46.1.126.15132","volume":"46","author":"PA Ouorou","year":"2000","unstructured":"Ouorou, P. A., Mahey, P., & Vial, J. (2000). A survey of algorithms for convex multicommodity flow problems. Management Science, 46(1), 126\u2013147.","journal-title":"Management Science"},{"issue":"6","key":"2667_CR30","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1016\/j.cor.2008.06.008","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith, A., & Ehrgott, M. (2009). A two-phase algorithm for the biobjective integer minimum cost flow problem. Computers & Operations Research, 36(6), 1945\u20131954.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"2667_CR31","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. Computers & Operations Research, 36(4), 1299\u20131331.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"2667_CR32","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1016\/j.comcom.2006.08.027","volume":"30","author":"CC Ribeiro","year":"2007","unstructured":"Ribeiro, C. C., Martins, S. L., & Rosseti, I. (2007). Metaheuristics for optimization problems in computer communications. Computer Communications, 30(4), 656\u2013669.","journal-title":"Computer Communications"},{"key":"2667_CR33","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-642-13161-5_7","volume":"73","author":"A Rubio-Largo","year":"2010","unstructured":"Rubio-Largo, A., Vega-Rodriguez, M. A., Gomez-Pulido, J. A., & Sanchez-Perez, J. M. (2010). Solving the routing and wavelength assignment problem in WDM networks by using a multiobjective variable neighborhood search algorithm. Advances in Intelligent and Soft Computing, 73, 47\u201354.","journal-title":"Advances in Intelligent and Soft Computing"},{"key":"2667_CR34","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.ejor.2003.11.012","volume":"164","author":"A Sedeno-Noda","year":"2005","unstructured":"Sedeno-Noda, A., Gonzalez-Martin, C., & Gutierrez, J. (2005). The biobjective undirected two-commodity minimum cost flow problem. European Journal of Operational Research, 164, 89\u2013103.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2667_CR35","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2298\/YJOR121120001S","volume":"23","author":"A Sifaleras","year":"2016","unstructured":"Sifaleras, A. (2016). Minimum cost network flows: Problems, algorithms, and software. Yugoslav Journal of Operations Research, 23(1), 3\u201317.","journal-title":"Yugoslav Journal of Operations Research"},{"issue":"3","key":"2667_CR36","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10732-005-0970-4","volume":"11","author":"C Stummer","year":"2005","unstructured":"Stummer, C., & Sun, M. (2005). New multiobjective metaheuristic solution procedures for capital investment planning. Journal of Heuristics, 11(3), 183\u2013199.","journal-title":"Journal of Heuristics"},{"issue":"5","key":"2667_CR37","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/S0305-0548(02)00055-2","volume":"30","author":"H Sun","year":"2003","unstructured":"Sun, H., & Wang, G. (2003). Parallel machine earliness and tardiness scheduling with proportional weights. Computers & Operations Research, 30(5), 801\u2013808.","journal-title":"Computers & Operations Research"},{"key":"2667_CR38","doi-asserted-by":"crossref","unstructured":"Veldhuizen, D. A. V., & Lamont, G. B. (1999). Multiobjective evolutionary algorithm test suites. In Proceedings of the 1999 ACM symposium on applied computing (pp. 351\u2013357).","DOI":"10.1145\/298151.298382"},{"key":"2667_CR39","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ins.2013.01.014","volume":"233","author":"H Xing","year":"2013","unstructured":"Xing, H., & Qu, R. (2013). A nondominated sorting genetic algorithm for bi-objective network coding based multicast routing problems. Information Sciences, 233, 36\u201353.","journal-title":"Information Sciences"},{"key":"2667_CR40","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J. Y. (1971). Finding the k-shortest loopless paths in a network. Management Science, 17, 712\u2013716.","journal-title":"Management Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2667-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2667-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2667-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T11:53:29Z","timestamp":1530791609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2667-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,13]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["2667"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2667-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,13]]}}}