{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:03Z","timestamp":1740122403585,"version":"3.37.3"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T00:00:00Z","timestamp":1636761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T00:00:00Z","timestamp":1636761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673359","71520107002"],"award-info":[{"award-number":["61673359","71520107002"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007251","name":"National Research University Higher School of Economics","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007251","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00823-0","type":"journal-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T21:26:38Z","timestamp":1636838798000},"page":"242-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A novel approach to subgraph selection with multiple weights on arcs"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3303-0981","authenticated-orcid":false,"given":"Mohammad Ali","family":"Raayatpanah","sequence":"first","affiliation":[]},{"given":"Salman","family":"Khodayifar","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Weise","sequence":"additional","affiliation":[]},{"given":"Panos","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Ahuja RK, Magnanti TL, Orlin JB, et\u00a0al (1995) Applications of network optimization. In: Ball MO, Magnanti TL, Monma CL et\u00a0al (eds) Network models, handbooks in operations research and management science, vol 7. Elsevier B. V., Cambridge, MA, USA, chap\u00a01, pp 1\u201383. https:\/\/doi.org\/10.1016\/S0927-0507(05)80118-5","key":"823_CR1","DOI":"10.1016\/S0927-0507(05)80118-5"},{"key":"823_CR2","volume-title":"Network flows\u2014theory, algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows\u2014theory, algorithms and applications. Prentice Hall, Englewood Cliffs"},{"issue":"4","key":"823_CR3","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10100-010-0140-0","volume":"19","author":"A Amirteimoori","year":"2011","unstructured":"Amirteimoori A (2011) An extended transportation problem: a DEA-based approach. Central Eur J Oper Res (CEJOR) 19(4):513\u2013521. https:\/\/doi.org\/10.1007\/s10100-010-0140-0","journal-title":"Central Eur J Oper Res (CEJOR)"},{"issue":"5439","key":"823_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"823_CR5","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"2011","unstructured":"Bazaraa MS, Jarvis JJ, Sherali HD (2011) Linear programming and network flows. Wiley, Hoboken"},{"issue":"4","key":"823_CR6","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0305-0548(88)90022-6","volume":"15","author":"K Belling-Seib","year":"1988","unstructured":"Belling-Seib K, Mevert P, M\u00fcller C (1988) Network flow problems with one side constraint: a comparison of three solution methods. Comput Oper Res 15(4):381\u2013394. https:\/\/doi.org\/10.1016\/0305-0548(88)90022-6","journal-title":"Comput Oper Res"},{"doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s B (2011) Random Graphs, 2nd edn. No.\u00a073 in Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/CBO9780511814068","key":"823_CR7","DOI":"10.1017\/CBO9780511814068"},{"issue":"2","key":"823_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0305-0548(91)90084-5","volume":"18","author":"N Bryson","year":"1991","unstructured":"Bryson N (1991) Parametric programming and Lagrangian relaxation: the case of the network problem with a single side-constraint. Comput Oper Res 18(2):129\u2013140. https:\/\/doi.org\/10.1016\/0305-0548(91)90084-5","journal-title":"Comput Oper Res"},{"key":"823_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A Charnes","year":"1962","unstructured":"Charnes A, Cooper WW (1962) Programming with linear fractional functions. Naval Res Logist 9:181\u2013186. https:\/\/doi.org\/10.1002\/nav.3800090303","journal-title":"Naval Res Logist"},{"key":"823_CR10","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/0377-2217(78)90138-8","volume":"2","author":"A Charnes","year":"1978","unstructured":"Charnes A, Cooper WW, Rhodes E (1978) Measuring the efficiency of decision making units. Eur J Oper Res (EJOR) 2:429\u2013444. https:\/\/doi.org\/10.1016\/0377-2217(78)90138-8","journal-title":"Eur J Oper Res (EJOR)"},{"issue":"3","key":"823_CR11","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res (ITOR) 23(3):551\u2013591. https:\/\/doi.org\/10.1111\/itor.12199","journal-title":"Int Trans Oper Res (ITOR)"},{"issue":"114","key":"823_CR12","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.eswa.2020.114186","volume":"168","author":"P Chen","year":"2021","unstructured":"Chen P (2021) Effects of the entropy weight on TOPSIS. Expert Syst Appl 168(114):186. https:\/\/doi.org\/10.1016\/j.eswa.2020.114186","journal-title":"Expert Syst Appl"},{"key":"823_CR13","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1016\/j.apm.2006.08.018","volume":"31","author":"L Chen","year":"2007","unstructured":"Chen L, Lu H (2007) An extended assignment problem considering multiple inputs and outputs. Appl Math Model 31:2239\u20132248. https:\/\/doi.org\/10.1016\/j.apm.2006.08.018","journal-title":"Appl Math Model"},{"issue":"1","key":"823_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230070105","volume":"7","author":"S Chen","year":"1977","unstructured":"Chen S, Saigal R (1977) A primal algorithm for solving a capacitated network flow problem with additional linear constraints. Networks 7(1):59\u201379. https:\/\/doi.org\/10.1002\/net.3230070105","journal-title":"Networks"},{"key":"823_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2013.09.004","volume":"44","author":"WD Cook","year":"2014","unstructured":"Cook WD, Tone K, Zhu J (2014) Data envelopment analysis: prior to choosing a model. Omega 44:1\u20134. https:\/\/doi.org\/10.1016\/j.omega.2013.09.004","journal-title":"Omega"},{"key":"823_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29122-9","volume-title":"Introduction to data envelopment analysis and its uses: with DEA-solver software and references","author":"WW Cooper","year":"2006","unstructured":"Cooper WW, Seiford LM, Tone K (2006) Introduction to data envelopment analysis and its uses: with DEA-solver software and references. Springer, New York. https:\/\/doi.org\/10.1007\/0-387-29122-9"},{"key":"823_CR17","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Hoboken"},{"key":"823_CR18","series-title":"Prentice Hall Series in Automatic Computation","volume-title":"Graph theory with applications to engineering and computer science","author":"N Deo","year":"1974","unstructured":"Deo N (1974) Graph theory with applications to engineering and computer science. Prentice Hall Series in Automatic Computation. Prentice-Hall Inc, Upper Saddle River"},{"key":"823_CR19","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1057\/jors.1994.84","volume":"45","author":"J Doyle","year":"1994","unstructured":"Doyle J, Green R (1994) Efficiency and cross-efficiency in DEA: derivations, meanings and uses. J Oper Res Soc 45:567\u2013578. https:\/\/doi.org\/10.1057\/jors.1994.84","journal-title":"J Oper Res Soc"},{"key":"823_CR20","series-title":"Series on applied mathematics","doi-asserted-by":"publisher","DOI":"10.1142\/1920","volume-title":"Network optimization problems: algorithms, applications and complexity","author":"D Du","year":"1993","unstructured":"Du D, Pardalos PM (1993) Network optimization problems: algorithms, applications and complexity, vol 2. Series on applied mathematics. World Scientific, Singapore"},{"key":"823_CR21","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.dam.2014.08.001","volume":"196","author":"C D\u00fcrr","year":"2015","unstructured":"D\u00fcrr C, Jez L, V\u00e1squez OC (2015) Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. Discret Appl Math 196:20\u201327. https:\/\/doi.org\/10.1016\/j.dam.2014.08.001","journal-title":"Discret Appl Math"},{"key":"823_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin. https:\/\/doi.org\/10.1007\/3-540-27659-9","edition":"2"},{"key":"823_CR23","series-title":"Princeton studies in complexity","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1515\/9781400841356.38","volume-title":"The structure and dynamics of networks","author":"P Erd\u00f6s","year":"2006","unstructured":"Erd\u00f6s P, R\u00e9nyi A (2006) On the evolution of random graphs. In: Newman M, Barab\u00e1si A, Watts DJ (eds) The structure and dynamics of networks, vol 19. Princeton studies in complexity. Princeton University Press, Princeton, pp 38\u201382. https:\/\/doi.org\/10.1515\/9781400841356.38"},{"issue":"2","key":"823_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1080\/1055678031000152079","volume":"18","author":"S Fang","year":"2003","unstructured":"Fang S, Qi L (2003) Manufacturing network flows: a generalized network flow model for manufacturing process modelling. Optim Methods Softw 18(2):143\u2013165. https:\/\/doi.org\/10.1080\/1055678031000152079","journal-title":"Optim Methods Softw"},{"issue":"3","key":"823_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.2307\/2343100","volume":"120","author":"M Farrell","year":"1957","unstructured":"Farrell M (1957) The measurement of productive efficiency. J R Stat Soc Ser A (General) 120(3):253\u2013290","journal-title":"J R Stat Soc Ser A (General)"},{"key":"823_CR26","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BFb0120942","volume-title":"Network models and associated applications, mathematical programming studies","author":"F Glover","year":"1981","unstructured":"Glover F, Klingman D (1981) The simplex SON algorithm for LP\/embedded network problems. In: Mulvey JM, Klingman D (eds) Network models and associated applications, mathematical programming studies, vol 15. Springer, New York, pp 148\u2013176. https:\/\/doi.org\/10.1007\/BFb0120942"},{"issue":"2","key":"823_CR27","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/nav.3800210204","volume":"21","author":"F Glover","year":"1974","unstructured":"Glover F, Klingman D, Ross GT (1974) Finding equivalent transportation formulations for constrained transportation problems. Naval Res Log Q 21(2):247\u2013254","journal-title":"Naval Res Log Q"},{"doi-asserted-by":"publisher","unstructured":"Glover F, Klingman D (1985) Basis exchange characterizations for the simplex SON algorithm for LP\/embedded networks. In: Cottle RW (ed) Mathematical programming essays in honor of George B. Dantzig, Part I, mathematical programming Studies, vol\u00a024. Springer, New York, pp 141\u2013157. https:\/\/doi.org\/10.1007\/BFb0121048","key":"823_CR28","DOI":"10.1007\/BFb0121048"},{"issue":"1","key":"823_CR29","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/s10878-015-9934-2","volume":"32","author":"L Guo","year":"2016","unstructured":"Guo L (2016) Efficient approximation algorithms for computing k disjoint constrained shortest paths. J Comb Optim 32(1):144\u2013158. https:\/\/doi.org\/10.1007\/s10878-015-9934-2","journal-title":"J Comb Optim"},{"issue":"3","key":"823_CR30","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.ejor.2005.09.033","volume":"176","author":"HW Hamacher","year":"2007","unstructured":"Hamacher HW, Pedersen CR, Ruzika S (2007) Multiple objective minimum cost flow problems: a review. Eur J Oper Res (EJOR) 176(3):1404\u20131422. https:\/\/doi.org\/10.1016\/j.ejor.2005.09.033","journal-title":"Eur J Oper Res (EJOR)"},{"key":"823_CR31","series-title":"Wiley series in probability and statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9781119196037","volume-title":"Nonparametric statistical methods","author":"M Hollander","year":"2014","unstructured":"Hollander M, Wolfe DA, Chicken E (2014) Nonparametric statistical methods, 3rd edn. Wiley series in probability and statistics. Wiley, Hoboken. https:\/\/doi.org\/10.1002\/9781119196037","edition":"3"},{"issue":"4","key":"823_CR32","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.1007\/s10878-015-9865-y","volume":"31","author":"M Holzhauser","year":"2016","unstructured":"Holzhauser M, Krumke SO, Thielen C (2016) Budget-constrained minimum cost flows. J Comb Optim 31(4):1720\u20131745. https:\/\/doi.org\/10.1007\/s10878-015-9865-y","journal-title":"J Comb Optim"},{"key":"823_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2020\/2439265","volume":"2439265","author":"Y Hu","year":"2020","unstructured":"Hu Y, Zhao X, Liu J et al (2020) An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions. Math Probl Eng 2439265:1\u20135. https:\/\/doi.org\/10.1155\/2020\/2439265","journal-title":"Math Probl Eng"},{"issue":"4","key":"823_CR34","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1007\/s11277-018-5285-5","volume":"99","author":"RA Khan","year":"2018","unstructured":"Khan RA, Mohammadani KH, Soomro AA et al (2018) An energy efficient routing protocol for wireless body area sensor networks. Wireless Pers Commun 99(4):1443\u20131454. https:\/\/doi.org\/10.1007\/s11277-018-5285-5","journal-title":"Wireless Pers Commun"},{"issue":"7","key":"823_CR35","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1287\/mnsc.23.7.737","volume":"23","author":"D Klingman","year":"1977","unstructured":"Klingman D (1977) Finding equivalent network formulations for constrained network problems. Manag Sci 23(7):737\u2013744. https:\/\/doi.org\/10.1287\/mnsc.23.7.737","journal-title":"Manag Sci"},{"issue":"1","key":"823_CR36","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1080\/10556788.2014.895828","volume":"30","author":"P Kov\u00e1cs","year":"2015","unstructured":"Kov\u00e1cs P (2015) Minimum-cost flow algorithms: an experimental evaluation. Optim Methods Softw 30(1):94\u2013127. https:\/\/doi.org\/10.1080\/10556788.2014.895828","journal-title":"Optim Methods Softw"},{"key":"823_CR37","volume-title":"Nonparametrics: statistical methods based on ranks","author":"EL Lehmann","year":"2006","unstructured":"Lehmann EL (2006) Nonparametrics: statistical methods based on ranks. Springer, New York"},{"issue":"2","key":"823_CR38","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.jnca.2012.12.020","volume":"36","author":"B Li","year":"2013","unstructured":"Li B, Springer J, Bebis G et al (2013) A survey of network flow applications. J Netw Comput Appl 36(2):567\u2013581. https:\/\/doi.org\/10.1016\/j.jnca.2012.12.020","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"823_CR39","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1111\/itor.12387","volume":"25","author":"AA Longaray","year":"2018","unstructured":"Longaray AA, Ensslin L, Ensslin SR et al (2018) Using MCDA to evaluate the performance of the logistics process in public hospitals: the case of a Brazilian teaching hospital. Int Trans Oper Res (ITOR) 25(1):133\u2013156. https:\/\/doi.org\/10.1111\/itor.12387","journal-title":"Int Trans Oper Res (ITOR)"},{"issue":"4","key":"823_CR40","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10878-006-8211-9","volume":"11","author":"H Lu","year":"2006","unstructured":"Lu H, Yao E, YaoQi L (2006) Some further results on minimum distribution cost flow problems. J Comb Optim 11(4):351\u2013371. https:\/\/doi.org\/10.1007\/s10878-006-8211-9","journal-title":"J Comb Optim"},{"issue":"5","key":"823_CR41","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/mnsc.46.5.693.12042","volume":"46","author":"JW Mamer","year":"2000","unstructured":"Mamer JW, McBride RD (2000) A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem. Manage Sci 46(5):693\u2013709. https:\/\/doi.org\/10.1287\/mnsc.46.5.693.12042","journal-title":"Manage Sci"},{"key":"823_CR42","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann HB, Whitney DR (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18:50\u201360. https:\/\/doi.org\/10.1214\/aoms\/1177730491","journal-title":"Ann Math Stat"},{"issue":"6","key":"823_CR43","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26(6):369\u2013395. https:\/\/doi.org\/10.1007\/s00158-003-0368-6","journal-title":"Struct Multidiscip Optim"},{"issue":"9","key":"823_CR44","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/S0305-0548(98)00001-X","volume":"25","author":"S Mathies","year":"1998","unstructured":"Mathies S, Mevert P (1998) A hybrid algorithm for solving network flow problems with side constraints. Comput Oper Res 25(9):745\u2013756. https:\/\/doi.org\/10.1016\/S0305-0548(98)00001-X","journal-title":"Comput Oper Res"},{"issue":"1","key":"823_CR45","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0377-2217(85)90091-8","volume":"21","author":"RD McBride","year":"1985","unstructured":"McBride RD (1985) Solving embedded generalized network problems. Eur J Oper Res (EJOR) 21(1):82\u201392","journal-title":"Eur J Oper Res (EJOR)"},{"issue":"2","key":"823_CR46","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.9.2.154","volume":"9","author":"RD McBride","year":"1997","unstructured":"McBride RD, Mamer JW (1997) Solving multicommodity flow problems with a primal embedded network simplex algorithm. INFORMS J Comput 9(2):154\u2013163. https:\/\/doi.org\/10.1287\/ijoc.9.2.154","journal-title":"INFORMS J Comput"},{"issue":"4","key":"823_CR47","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.1035","volume":"38","author":"RD McBride","year":"2001","unstructured":"McBride RD, Mamer JW (2001) Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm. Networks 38(4):181\u2013188. https:\/\/doi.org\/10.1002\/net.1035","journal-title":"Networks"},{"issue":"1","key":"823_CR48","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.amc.2005.01.041","volume":"171","author":"J Mo","year":"2005","unstructured":"Mo J, Qi L, Wei Z (2005) A manufacturing supply chain optimization model for distilling process. Appl Math Comput 171(1):464\u2013485. https:\/\/doi.org\/10.1016\/j.amc.2005.01.041","journal-title":"Appl Math Comput"},{"issue":"8","key":"823_CR49","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1038\/S41928-019-0286-2","volume":"2","author":"S Niu","year":"2019","unstructured":"Niu S, Matsuhisa N, Beker L et al (2019) A wireless body area sensor network based on stretchable passive tags. Nat Electron 2(8):361\u2013368. https:\/\/doi.org\/10.1038\/S41928-019-0286-2","journal-title":"Nat Electron"},{"issue":"2","key":"823_CR50","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin JB (1993) A faster strongly polynomial minimum cost flow algorithm. Oper Res 41(2):338\u2013350. https:\/\/doi.org\/10.1287\/opre.41.2.338","journal-title":"Oper Res"},{"issue":"2","key":"823_CR51","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02614365","volume":"78","author":"JB Orlin","year":"1997","unstructured":"Orlin JB (1997) A polynomial time primal network simplex algorithm for minimum cost flows. Math Program 78(2):109\u2013129. https:\/\/doi.org\/10.1007\/BF02614365","journal-title":"Math Program"},{"key":"823_CR52","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3084","author":"MA Raayatpanah","year":"2017","unstructured":"Raayatpanah MA (2017a) Multicast routing based on data envelopment analysis with multiple quality of service parameters. Int J Commun Syst. https:\/\/doi.org\/10.1002\/dac.3084","journal-title":"Int J Commun Syst"},{"key":"823_CR53","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3079","author":"MA Raayatpanah","year":"2017","unstructured":"Raayatpanah MA (2017b) Subgraph selection over coded packet networks with multiple QOS parameters based on DEA. Trans Emerg Telecommun Technol. https:\/\/doi.org\/10.1002\/ett.3079","journal-title":"Trans Emerg Telecommun Technol"},{"key":"823_CR54","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.jnca.2013.12.004","volume":"41","author":"MA Raayatpanah","year":"2014","unstructured":"Raayatpanah MA, Fathabadi HS, Khalaj BH et al (2014) Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks. J Netw Comput Appl 41:217\u2013227. https:\/\/doi.org\/10.1016\/j.jnca.2013.12.004","journal-title":"J Netw Comput Appl"},{"key":"823_CR55","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/j.amc.2015.05.109","volume":"265","author":"A Sede\u00f1o-Noda","year":"2015","unstructured":"Sede\u00f1o-Noda A, Alonso-Rodr\u00edguez S (2015) An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem. Appl Math Comput 265:602\u2013618. https:\/\/doi.org\/10.1016\/j.amc.2015.05.109","journal-title":"Appl Math Comput"},{"key":"823_CR56","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/ev.1441","volume":"32","author":"TR Sexton","year":"1986","unstructured":"Sexton TR, Silkman RH, Hogan AJ (1986) Data envelopment analysis: critique and extensions. New Direct Program Eval 32:73\u2013105. https:\/\/doi.org\/10.1002\/ev.1441","journal-title":"New Direct Program Eval"},{"doi-asserted-by":"publisher","unstructured":"Singh AK, Mishra SK, Dixit S (2019) Energy efficiency in wireless sensor networks: Cooperative MIMO-OFDM. In: Recent trends in communication, computing, and electronics: select proceedings of IC3E 2018, Lecture notes in electrical engineering, vol 524. Springer, Singapore, pp 147\u2013154. https:\/\/doi.org\/10.1007\/978-981-13-2685-1_16","key":"823_CR57","DOI":"10.1007\/978-981-13-2685-1_16"},{"issue":"1","key":"823_CR58","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/1097-0037(200008)36:1<53::AID-NET6>3.0.CO;2-Y","volume":"36","author":"PT Sokkalingam","year":"2000","unstructured":"Sokkalingam PT, Ahuja RK, Orlin JB (2000) New polynomial-time cycle-canceling algorithms for minimum-cost flows. Netw: Int J 36(1):53\u201363","journal-title":"Netw: Int J"},{"issue":"2","key":"823_CR59","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1111\/itor.12361","volume":"25","author":"L Song","year":"2018","unstructured":"Song L, Liu F (2018) An improvement in DEA cross-efficiency aggregation based on the Shannon entropy. Int Trans Oper Res (ITOR) 25(2):705\u2013714. https:\/\/doi.org\/10.1111\/itor.12361","journal-title":"Int Trans Oper Res (ITOR)"},{"issue":"1","key":"823_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01719766","volume":"13","author":"SB Sp\u00e4lti","year":"1991","unstructured":"Sp\u00e4lti SB, Liebling TM (1991) Modeling the satellite placement problem as a network flow problem with one side constraint. Operations-Research-Spektrum 13(1):1\u201314. https:\/\/doi.org\/10.1007\/BF01719766","journal-title":"Operations-Research-Spektrum"},{"issue":"2","key":"823_CR61","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1111\/itor.12212","volume":"25","author":"CTT Tran","year":"2018","unstructured":"Tran CTT, Villano RA (2018) Measuring efficiency of Vietnamese public colleges: an application of the DEA-based dynamic network approach. Int Trans Oper Res (ITOR) 25(2):683\u2013703. https:\/\/doi.org\/10.1111\/itor.12212","journal-title":"Int Trans Oper Res (ITOR)"},{"key":"823_CR62","doi-asserted-by":"publisher","DOI":"10.1201\/b11032","volume-title":"Multiple attribute decision making: methods and applications","author":"G Tzeng","year":"2011","unstructured":"Tzeng G, Huang J (2011) Multiple attribute decision making: methods and applications. Chapman and Hall, London"},{"issue":"4","key":"823_CR63","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10878-007-9080-6","volume":"15","author":"P Venkateshan","year":"2008","unstructured":"Venkateshan P, Mathur K, Ballou RH (2008) An efficient generalized network-simplex-based algorithm for manufacturing network flows. J Comb Optim 15(4):315\u2013341. https:\/\/doi.org\/10.1007\/s10878-007-9080-6","journal-title":"J Comb Optim"},{"key":"823_CR64","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-1-4419-7997-1_63","volume-title":"Handbook of combinatorial optimization","author":"C Vogiatzis","year":"2013","unstructured":"Vogiatzis C, Pardalos PM (2013) Combinatorial optimization in transportation and logistics networks. In: Pardalos PM, Du D, Graham RL (eds) Handbook of combinatorial optimization, 2nd edn. Springer, New York, pp 673\u2013722. https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_63","edition":"2"},{"key":"823_CR65","series-title":"Princeton studies in complexity","volume-title":"Small worlds: the dynamics of networks between order and randomness","author":"DJ Watts","year":"2003","unstructured":"Watts DJ (2003) Small worlds: the dynamics of networks between order and randomness. Princeton studies in complexity. Princeton University Press, Princeton"},{"issue":"9","key":"823_CR66","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"BM Waxman","year":"1988","unstructured":"Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6(9):1617\u20131622. https:\/\/doi.org\/10.1109\/49.12889","journal-title":"IEEE J Sel Areas Commun"},{"key":"823_CR67","doi-asserted-by":"publisher","DOI":"10.4236\/cn.2014.61006","author":"C Yang","year":"2014","unstructured":"Yang C, Zhao X (2014) A new delay-constrained multicast routing algorithm based on shared edges. Commun Netw. https:\/\/doi.org\/10.4236\/cn.2014.61006","journal-title":"Commun Netw"},{"issue":"2","key":"823_CR68","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2013.05.017","volume":"231","author":"G Yang","year":"2013","unstructured":"Yang G, Yang J, Liu W et al (2013) Cross-efficiency aggregation in DEA models using the evidential-reasoning approach. Eur J Oper Res (EJOR) 231(2):393\u2013404. https:\/\/doi.org\/10.1016\/j.ejor.2013.05.017","journal-title":"Eur J Oper Res (EJOR)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00823-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00823-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00823-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:28:33Z","timestamp":1659079713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00823-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,13]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["823"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00823-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,11,13]]},"assertion":[{"value":"5 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All authors agree to the publication of the article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}