{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:42:37Z","timestamp":1730227357428,"version":"3.28.0"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T00:00:00Z","timestamp":1693353600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8,30]]},"DOI":"10.1109\/icac57885.2023.10275179","type":"proceedings-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T17:58:56Z","timestamp":1697479136000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["A Linear Programming Approach for Maximum Integral Multiflow and Minimum Multicut Problems in Unrestricted Network"],"prefix":"10.1109","author":[{"given":"Siyue","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Reliability and Systems Engineering, Beihang University,Beijing,China"}]},{"given":"Yiyong","family":"Xiao","sequence":"additional","affiliation":[{"name":"School of Reliability and Systems Engineering, Beihang University,Beijing,China"}]},{"given":"Xinhao","family":"Cui","sequence":"additional","affiliation":[{"name":"School of Reliability and Systems Engineering, Beihang University,Beijing,China"}]},{"given":"Ruiyi","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Reliability and Systems Engineering, Beihang University,Beijing,China"}]}],"member":"263","reference":[{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523685"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.10.037"},{"key":"ref3","first-page":"215","article-title":"On the max-flow min-cut theorem of networks","volume":"38","author":"dantzig","year":"1956","journal-title":"Linear Inequalities and Related Systems Annals of Mathematics Studies 38"},{"key":"ref6","first-page":"239","article-title":"Coloring away communication in parallel query optimization","author":"hasan","year":"1995","journal-title":"Proceedings of the 21st VLDB Conference"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00187-0"},{"journal-title":"Fundamentals of a Method for Evaluating Rail Net Capacities","year":"1955","author":"harris","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1605083113"}],"event":{"name":"2023 28th International Conference on Automation and Computing (ICAC)","start":{"date-parts":[[2023,8,30]]},"location":"Birmingham, United Kingdom","end":{"date-parts":[[2023,9,1]]}},"container-title":["2023 28th International Conference on Automation and Computing (ICAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10275139\/10275143\/10275179.pdf?arnumber=10275179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T18:57:23Z","timestamp":1699297043000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10275179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,30]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/icac57885.2023.10275179","relation":{},"subject":[],"published":{"date-parts":[[2023,8,30]]}}}