{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:37:28Z","timestamp":1769164648597,"version":"3.49.0"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tase.2024.3417820","type":"journal-article","created":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T21:36:47Z","timestamp":1719351407000},"page":"5207-5225","source":"Crossref","is-referenced-by-count":2,"title":["A Streamlined Heuristic for the Problem of Min-Time Coverage in Constricted Environments"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7426-5499","authenticated-orcid":false,"given":"Young-In","family":"Kim","sequence":"first","affiliation":[{"name":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6176-0925","authenticated-orcid":false,"given":"Spyros","family":"Reveliotis","sequence":"additional","affiliation":[{"name":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32552-1_53"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32552-1_60"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32552-1_58"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1201\/9781420066272"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.08.023"},{"key":"ref6","volume-title":"Industrial Digital Transformation","author":"Nath","year":"2020"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/net.21847"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-071420-080708"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911537"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830370"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.3000742"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909358274"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798244"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-3751-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2873237"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2020.107206"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3390\/s21113862"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2022.9771355"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2021.3124167"},{"key":"ref20","volume-title":"Integer Programming","author":"Wolsey","year":"1998"},{"key":"ref21","volume-title":"Computational Complexity","author":"Papadimitriou","year":"1995"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2022.10.316"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2023.3298880"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2023.3295348"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1515\/9780691187563"},{"key":"ref26","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"ref27","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1998"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref29","volume-title":"Optimization in Operations Research","author":"Rardin","year":"1998"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref31","volume-title":"Probability and Statistics","author":"Schervish","year":"2014"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8856\/10839176\/10571815.pdf?arnumber=10571815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T18:43:59Z","timestamp":1741027439000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10571815\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/tase.2024.3417820","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}