{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T22:35:04Z","timestamp":1770417304027,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"DOI":"10.1145\/3269206.3272017","type":"proceedings-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T12:08:27Z","timestamp":1540210107000},"page":"2137-2145","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Network-based Receivable Financing"],"prefix":"10.1145","author":[{"given":"Ilaria","family":"Bordino","sequence":"first","affiliation":[{"name":"UniCredit, Rome, Italy"}]},{"given":"Francesco","family":"Gullo","sequence":"additional","affiliation":[{"name":"UniCredit, Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.12.015"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_3_2_1_4_1","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman & Co.   M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness .W. H. Freeman & Co."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.46"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.430"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q"},{"key":"e_1_3_2_1_8_1","unstructured":"K. A. Hawick and H. James. 2008. Enumerating Circuits and Loops in Graphs with Self-Arcs and Multiple-Arcs. In FCS . 14--20.  K. A. Hawick and H. James. 2008. Enumerating Circuits and Loops in Graphs with Self-Arcs and Multiple-Arcs. In FCS . 14--20."},{"key":"e_1_3_2_1_9_1","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Hochbaum D. S."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"H. Kellerer U. Pferschy and D. Pisinger. 2004. Knapsack problems .Springer.  H. Kellerer U. Pferschy and D. Pisinger. 2004. Knapsack problems .Springer.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9438-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","volume-title":"Network Flow Optimization with Minimum Quantities","author":"Seedig H. G.","DOI":"10.1007\/978-3-642-20009-0_47"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2565468"}],"event":{"name":"CIKM '18: The 27th ACM International Conference on Information and Knowledge Management","location":"Torino Italy","acronym":"CIKM '18","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 27th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3272017","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3272017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:20Z","timestamp":1750208240000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3272017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":14,"alternative-id":["10.1145\/3269206.3272017","10.1145\/3269206"],"URL":"https:\/\/doi.org\/10.1145\/3269206.3272017","relation":{},"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"2018-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}