乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T20:46:22Z","timestamp":1720298782969},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T00:00:00Z","timestamp":1701129600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FL140100012","IC200100009"],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001782","name":"University of Melbourne","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001782","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1016\/j.cor.2023.106492","type":"journal-article","created":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T12:50:38Z","timestamp":1701521438000},"page":"106492","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the impact of initialisation strategies on Maximum Flow algorithm performance"],"prefix":"10.1016","volume":"163","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-9698-765X","authenticated-orcid":false,"given":"Hossein","family":"Alipour","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7254-2808","authenticated-orcid":false,"given":"Mario Andr\u00e9s","family":"Mu\u00f1oz","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2718-7680","authenticated-orcid":false,"given":"Kate","family":"Smith-Miles","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2023.106492_b1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(96)00269-X","article-title":"Computational investigations of maximum flow algorithms","volume":"97","author":"Ahuja","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106492_b2","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/j.cor.2023.106492_b3","series-title":"HAlipour8463\/ISA_MFP: Jun 2021 Release","author":"Alipour","year":"2021"},{"key":"10.1016\/j.cor.2023.106492_b4","series-title":"Maximum Flow Algorithms with Different Types of Initialisations","author":"Alipour","year":"2022"},{"issue":"1","key":"10.1016\/j.cor.2023.106492_b5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40467-017-0058-3","article-title":"Uncertain dynamic network flow problems","volume":"5","author":"Alipour","year":"2017","journal-title":"J. Uncertain. Anal. Appl."},{"issue":"2","key":"10.1016\/j.cor.2023.106492_b6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.ejor.2022.04.012","article-title":"Enhanced instance space analysis for the maximum flow problem","volume":"304","author":"Alipour","year":"2023","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"10.1016\/j.cor.2023.106492_b7","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","article-title":"An experimental comparison of Min-Cut\/Max-Flow algorithms for energy minimization in computer vision","volume":"26","author":"Boykov","year":"2004","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"10.1016\/j.cor.2023.106492_b8","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/opre.1080.0572","article-title":"A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem","volume":"27","author":"Chandran","year":"2009","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2023.106492_b9","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/PL00009180","article-title":"On implementing push-relabel method for the maximum flow problem","volume":"19","author":"Cherkassky","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/j.cor.2023.106492_b10","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"Dinic","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/j.cor.2023.106492_b11","series-title":"Issledovaniya po Diskretnoi","article-title":"The method of scaling and transportation problems","author":"Dinic","year":"1973"},{"issue":"2","key":"10.1016\/j.cor.2023.106492_b12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/j.cor.2023.106492_b13","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canadian J. Math."},{"key":"10.1016\/j.cor.2023.106492_b14","series-title":"Algorithms - ESA 2008","first-page":"466","article-title":"The partial Augment\u2013Relabel algorithm for the maximum flow problem","author":"Goldberg","year":"2008"},{"key":"10.1016\/j.cor.2023.106492_b15","series-title":"AAIM, LNCS. Vol. 5564. No. 09","first-page":"212","article-title":"Two-level push-relabel algorithm for the maximum flow problem","author":"Goldberg","year":"2009"},{"key":"10.1016\/j.cor.2023.106492_b16","series-title":"Algorithms\u2014ESA","first-page":"619","article-title":"Faster and more dynamic maximum flow by incremental breadth-first search","author":"Goldberg","year":"2015"},{"key":"10.1016\/j.cor.2023.106492_b17","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/j.cor.2023.106492_b18","series-title":"Fundamentals of a Method for Evaluating Rail Net Capacities","author":"Harris","year":"1955"},{"issue":"4","key":"10.1016\/j.cor.2023.106492_b19","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.1080.0524","article-title":"The pseudoflow algorithm: A new algorithm for the maximum-flow problem","volume":"56","author":"Hochbaum","year":"2008","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2023.106492_b20","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1002\/net.21467","article-title":"Simplifications and speedups of the pseudoflow algorithm","volume":"61.1","author":"Hochbaum","year":"2013","journal-title":"Networks"},{"key":"10.1016\/j.cor.2023.106492_b21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","article-title":"Testing heuristics: we have it all wrong","volume":"1","author":"Hooker","year":"1995","journal-title":"J. Heurist."},{"key":"10.1016\/j.cor.2023.106492_b22","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov","year":"1974","journal-title":"Sov. Math. Dokladi"},{"key":"10.1016\/j.cor.2023.106492_b23","series-title":"IEEE Cong. Evol. Comput.","first-page":"2585","article-title":"A review of population initialization techniques for evolutionary algorithms","author":"Kazimipour","year":"2014"},{"key":"10.1016\/j.cor.2023.106492_b24","series-title":"Instance Space Analysis: A toolkit for the assessment of algorithmic power","author":"Mu\u00f1oz","year":"2020"},{"issue":"1","key":"10.1016\/j.cor.2023.106492_b25","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10994-017-5629-5","article-title":"Instance spaces for machine learning classification","volume":"107","author":"Mu\u00f1oz","year":"2018","journal-title":"Mach. Learn."},{"key":"10.1016\/j.cor.2023.106492_b26","series-title":"Proc Annl ACM Symp Theo Comput","first-page":"765","article-title":"Max flows in O(nm) time, or better","author":"Orlin","year":"2013"},{"key":"10.1016\/j.cor.2023.106492_b27","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","article-title":"The algorithm selection problem","volume":"15","author":"Rice","year":"1976","journal-title":"Adv. Comput."},{"key":"10.1016\/j.cor.2023.106492_b28","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s11590-017-1107-z","article-title":"On the comparison of initialisation strategies in differential evolution for large scale optimisation","volume":"12","author":"Segredo","year":"2018","journal-title":"Opt. Lett."},{"key":"10.1016\/j.cor.2023.106492_b29","unstructured":"Smith-Miles, K.A., 2007. Generalising meta-learning concepts: from machine learning to meta-heuristics. In: 7th Meta-Heur Int Conf. MIC\u201907."},{"issue":"6","key":"10.1016\/j.cor.2023.106492_b30","first-page":"1","article-title":"Cross-disciplinary perspectives on meta-learning for algorithm selection","volume":"41","author":"Smith-Miles","year":"2008","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.cor.2023.106492_b31","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K.A., 2008b. Towards insightful algorithm selection for optimisation using meta-learning concepts. In: IEEE Int. Joint Conf Neural Netw. pp. 4118\u20134124.","DOI":"10.1109\/IJCNN.2008.4634391"},{"key":"10.1016\/j.cor.2023.106492_b32","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","article-title":"Towards objective measures of algorithm performance across instance space","volume":"45","author":"Smith-Miles","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106492_b33","series-title":"MATILDA: Melbourne algorithm test instance library with data analytics","author":"Smith-Miles","year":"2020"},{"issue":"1","key":"10.1016\/j.cor.2023.106492_b34","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2023.106492_b35","first-page":"565","article-title":"SATzilla: Portfolio-based algorithm selection for SAT","volume":"32","author":"Xu","year":"2008","journal-title":"J. Artif. Intel. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003568?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003568?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T18:33:41Z","timestamp":1704738821000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054823003568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":35,"alternative-id":["S0305054823003568"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2023.106492","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the impact of initialisation strategies on Maximum Flow algorithm performance","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2023.106492","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"106492"}}