{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T16:53:31Z","timestamp":1782492811062,"version":"3.54.5"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003489","name":"Henan University of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003489","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Reliability Engineering &amp; System Safety"],"published-print":{"date-parts":[[2027,1]]},"DOI":"10.1016\/j.ress.2026.113060","type":"journal-article","created":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:20:17Z","timestamp":1782314417000},"page":"113060","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"P2","title":["Real-time optimization and instant predictive assessment of network modifications via a novel cut pool-based framework"],"prefix":"10.1016","volume":"277","author":[{"given":"Wei","family":"Wei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hui","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ress.2026.113060_b1","article-title":"A composite index framework for quantitative resilience assessment of road infrastructure systems","volume":"131","author":"Nickdoost","year":"2024","journal-title":"Transp Res Part D: Transp Environ"},{"issue":"1","key":"10.1016\/j.ress.2026.113060_b2","article-title":"Resilience assessment of critical infrastructures using dynamic Bayesian networks and evidence propagation","volume":"241","author":"Caetano","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"10.1016\/j.ress.2026.113060_b3","article-title":"The evolution of urban ecological resilience: An evaluation framework based on vulnerability, sensitivity and self-organization","volume":"116","author":"Feng","year":"2024","journal-title":"Sustain Cities Soc"},{"issue":"1","key":"10.1016\/j.ress.2026.113060_b4","article-title":"Structural resilience evolution and vulnerability assessment of semiconductor materials supply network in the global semiconductor industry","volume":"270","author":"Yu","year":"2024","journal-title":"Int J Prod Econ"},{"issue":"1","key":"10.1016\/j.ress.2026.113060_b5","article-title":"A demand-based three-stage seismic resilience assessment and multi-objective optimization method of community water distribution networks","volume":"250","author":"Zhang","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"10.1016\/j.ress.2026.113060_b6","article-title":"Evaluation of robustness in underground networks","volume":"651","author":"Mussone","year":"2024","journal-title":"Phys A"},{"issue":"1","key":"10.1016\/j.ress.2026.113060_b7","article-title":"Combining multi-step reconfiguration with many-objective reduction as iterative bi-level scheduling for stochastic distribution network","volume":"290","author":"Li","year":"2024","journal-title":"Energy"},{"issue":"2","key":"10.1016\/j.ress.2026.113060_b8","doi-asserted-by":"crossref","first-page":"2942","DOI":"10.1109\/TR.2024.3438810","article-title":"Resilience metric and dynamic assessment of unmanned system-of-systems considering cooperative reconfiguration strategies","volume":"74","author":"Chen","year":"2025","journal-title":"IEEE Trans Reliab"},{"issue":"22","key":"10.1016\/j.ress.2026.113060_b9","doi-asserted-by":"crossref","first-page":"47094","DOI":"10.1109\/JIOT.2025.3598271","article-title":"A novel assessment and optimization method of 6G distributed network topology resilience based on groupwise collaborative algorithm","volume":"12","author":"Lu","year":"2025","journal-title":"IEEE Internet Things J"},{"issue":"3","key":"10.1016\/j.ress.2026.113060_b10","doi-asserted-by":"crossref","first-page":"2360","DOI":"10.1109\/TMC.2024.3492002","article-title":"DAiMo: Motif density enhances topology robustness for highly dynamic scale-free IoT","volume":"24","author":"Chen","year":"2025","journal-title":"IEEE Trans Mob Comput"},{"issue":"1","key":"10.1016\/j.ress.2026.113060_b11","article-title":"Graph reinforcement learning for real-time dynamic reconfiguration and fault management in energy storage networks","volume":"125","author":"Gao","year":"2025","journal-title":"J Energy Storage"},{"issue":"12","key":"10.1016\/j.ress.2026.113060_b12","doi-asserted-by":"crossref","first-page":"20983","DOI":"10.1109\/JIOT.2023.3348837","article-title":"Joint optimization risk factor and energy consumption in IoT networks with TinyML-enabled internet of UAVs","volume":"11","author":"Liu","year":"2024","journal-title":"IEEE Internet Things J"},{"issue":"18","key":"10.1016\/j.ress.2026.113060_b13","doi-asserted-by":"crossref","first-page":"37940","DOI":"10.1109\/JIOT.2025.3584536","article-title":"Resilience evaluation and optimization method of large-scale LEO satellite networks based on entropy theory","volume":"12","author":"Zhou","year":"2025","journal-title":"IEEE Internet Things J"},{"issue":"2","key":"10.1016\/j.ress.2026.113060_b14","doi-asserted-by":"crossref","first-page":"2011","DOI":"10.1109\/TIA.2024.3496846","article-title":"Coordinated distributionally robust optimal allocation of energy storage system for HV-MV distribution network resilience enhancement","volume":"61","author":"Cao","year":"2025","journal-title":"IEEE Trans Ind Appl"},{"issue":"1","key":"10.1016\/j.ress.2026.113060_b15","article-title":"Large-scale robustness-oriented efficient edge addition through traversal tree-based weak edge identification","volume":"179","author":"Wei","year":"2024","journal-title":"Chaos Solitons Fractals"},{"issue":"2","key":"10.1016\/j.ress.2026.113060_b16","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/JSAC.2025.3528810","article-title":"DateLine: Efficient algorithm for computing region disjoint paths in backbone networks","volume":"43","author":"B\u00e9rczi-Kovacs","year":"2025","journal-title":"IEEE J Sel Areas Commun"},{"issue":"6","key":"10.1016\/j.ress.2026.113060_b17","first-page":"4575","article-title":"Protection of large sparse network through optimal cropped depth-first traversal tree","volume":"12","author":"Wei","year":"2025","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"5","key":"10.1016\/j.ress.2026.113060_b18","doi-asserted-by":"crossref","first-page":"5035","DOI":"10.1109\/TNSE.2024.3423418","article-title":"Partition clustering in complex weighted networks using K-cut ranking and Krill-Herd optimization","volume":"11","author":"Srivastava","year":"2024","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"10.1016\/j.ress.2026.113060_b19","series-title":"Proceedings of international workshop on energy minimization methods in computer vision and pattern recognition","first-page":"219","article-title":"Slimcuts: Graphcuts for high resolution images using graph reduction","author":"Scheuermann","year":"2011"},{"issue":"17","key":"10.1016\/j.ress.2026.113060_b20","doi-asserted-by":"crossref","first-page":"2187","DOI":"10.1016\/j.dam.2011.06.030","article-title":"Simplifying maximum flow computations: The effect of shrinking and good initial flows","volume":"159","author":"Liers","year":"2011","journal-title":"Discrete Appl Math"},{"key":"10.1016\/j.ress.2026.113060_b21","series-title":"Proceedings of international conference on omputational intelligence and security","first-page":"482","article-title":"Research on the maximum flow in large-scale network","author":"Zhang","year":"2011"},{"key":"10.1016\/j.ress.2026.113060_b22","series-title":"Proceedings of the ACM SIGKDD workshop on mining data semantics","first-page":"1","article-title":"Contraction network for solving maximum flow problem","author":"Zhao","year":"2012"},{"key":"10.1016\/j.ress.2026.113060_b23","series-title":"Proceedings of international conference on granular computing (grC)","first-page":"651","article-title":"Contracting community for computing maximum flow","author":"Zhang","year":"2012"},{"issue":"7","key":"10.1016\/j.ress.2026.113060_b24","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1109\/LCOMM.2018.2830786","article-title":"SPLMax: Exploiting the simple path introduced locality for maximum flow acceleration","volume":"22","author":"Wei","year":"2018","journal-title":"IEEE Commun Lett"},{"issue":"8","key":"10.1016\/j.ress.2026.113060_b25","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/2628036","article-title":"Efficient maximum flow algorithms","volume":"57","author":"Goldberg","year":"2014","journal-title":"Commun ACM"},{"key":"10.1016\/j.ress.2026.113060_b26","series-title":"AAAI","article-title":"The network data repository with interactive graph analytics and visualization","author":"Rossi","year":"2025"}],"container-title":["Reliability Engineering &amp; System Safety"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832026008690?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832026008690?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T16:42:56Z","timestamp":1782492176000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0951832026008690"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2027,1]]},"references-count":26,"alternative-id":["S0951832026008690"],"URL":"https:\/\/doi.org\/10.1016\/j.ress.2026.113060","relation":{},"ISSN":["0951-8320"],"issn-type":[{"value":"0951-8320","type":"print"}],"subject":[],"published":{"date-parts":[[2027,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Real-time optimization and instant predictive assessment of network modifications via a novel cut pool-based framework","name":"articletitle","label":"Article Title"},{"value":"Reliability Engineering & System Safety","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ress.2026.113060","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"113060"}}