{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:52:14Z","timestamp":1765889534806},"reference-count":0,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2023f6191","type":"proceedings-article","created":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T20:10:40Z","timestamp":1697227840000},"page":"421-430","source":"Crossref","is-referenced-by-count":0,"title":["Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times"],"prefix":"10.15439","volume":"35","author":[{"given":"Mauro","family":"Dell'Amico","sequence":"first","affiliation":[]},{"given":"Jafar","family":"Jamal","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Montemanni","sequence":"additional","affiliation":[]}],"member":"6175","published-online":{"date-parts":[[2023,9,26]]},"event":{"name":"18th Conference on Computer Science and Intelligence Systems","start":{"date-parts":[[2023,9,17]]},"end":{"date-parts":[[2023,9,20]]},"acronym":"FedCSIS 2023"},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 18th Conference on Computer Science and Intelligence Systems"],"original-title":[],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T17:05:09Z","timestamp":1725123909000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_35\/drp\/6191.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,26]]},"references-count":0,"URL":"https:\/\/doi.org\/10.15439\/2023f6191","relation":{},"ISSN":["2300-5963"],"issn-type":[{"type":"print","value":"2300-5963"}],"subject":[],"published":{"date-parts":[[2023,9,26]]}}}