{"id":"https://openalex.org/W4385286336","doi":"https://doi.org/10.1109/tac.2023.3298880","title":"A Strong Combinatorial Relaxation for the Problem of Min-Time Coverage in Constricted Environments","display_name":"A Strong Combinatorial Relaxation for the Problem of Min-Time Coverage in Constricted Environments","publication_year":2023,"publication_date":"2023-07-26","ids":{"openalex":"https://openalex.org/W4385286336","doi":"https://doi.org/10.1109/tac.2023.3298880"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2023.3298880","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/tac.2023.3298880","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102725531","display_name":"Young-In Kim","orcid":"https://orcid.org/0009-0000-7426-5499"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Young-In Kim","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008675858","display_name":"Spyros Reveliotis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyros Reveliotis","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102725531"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":1.0382,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.80074532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"69","issue":"5","first_page":"2963","last_page":"2978"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9404000043869019,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9404000043869019,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9344000220298767,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9017999768257141,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6004347801208496},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48528334498405457},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.401213675737381},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3233536183834076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3214837312698364},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.09266915917396545}],"concepts":[{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6004347801208496},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48528334498405457},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.401213675737381},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3233536183834076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3214837312698364},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.09266915917396545},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2023.3298880","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/tac.2023.3298880","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Climate action","id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W200058615","https://openalex.org/W1479694349","https://openalex.org/W1841642927","https://openalex.org/W2053913299","https://openalex.org/W2059061256","https://openalex.org/W2106371135","https://openalex.org/W2191404279","https://openalex.org/W2241553860","https://openalex.org/W2569424779","https://openalex.org/W2765333890","https://openalex.org/W2888729493","https://openalex.org/W2894758515","https://openalex.org/W2950119225","https://openalex.org/W2952408149","https://openalex.org/W2963697709","https://openalex.org/W3010789021","https://openalex.org/W3034546171","https://openalex.org/W3120581161","https://openalex.org/W3171244254","https://openalex.org/W3208388366","https://openalex.org/W3209213092","https://openalex.org/W4212851288","https://openalex.org/W4213060235","https://openalex.org/W4229446365","https://openalex.org/W4235414394","https://openalex.org/W4255174402","https://openalex.org/W4313172557"],"related_works":["https://openalex.org/W2386767533","https://openalex.org/W2620834727","https://openalex.org/W2045367737","https://openalex.org/W3089260775","https://openalex.org/W2155209963","https://openalex.org/W4289549123","https://openalex.org/W2108882094","https://openalex.org/W1997135619","https://openalex.org/W2891176708","https://openalex.org/W3120162513"],"abstract_inverted_index":{"In":[0],"a":[1,6,65],"recent":[2],"work,":[3],"we":[4],"introduced":[5],"new":[7,107],"set":[8],"of":[9,14,25,47,79,102,113,133],"problems":[10,43],"in":[11,31,44,129],"the":[12,22,37,45,48,76,89,99,103,111,122,130],"area":[13],"networked":[15],"multiple":[16],"mobile":[17],"robotic":[18],"systems":[19],"that":[20,75],"concern":[21],"time-optimal":[23],"execution":[24],"certain":[26],"coverage":[27],"tasks":[28],"taking":[29],"place":[30],"constricted":[32],"environments.":[33],"That":[34],"work":[35],"provided":[36],"detailed":[38],"problem":[39],"definitions,":[40],"positioned":[41],"these":[42,70,80],"context":[46],"corresponding":[49],"literature,":[50],"formulated":[51],"them":[52],"as":[53],"mixed":[54],"integer":[55],"programs":[56],"(MIPs),":[57],"and":[58,72,118],"established":[59],"their":[60],"NP-hardness.":[61],"This":[62],"article":[63],"introduces":[64],"strong":[66],"combinatorial":[67],"relaxation":[68],"for":[69,88,121],"problems,":[71],"further":[73],"establishes":[74],"feasible":[77,86],"solutions":[78,87],"relaxations":[81],"can":[82],"be":[83],"converted":[84,104],"to":[85],"original":[90],"MIPs":[91],"with":[92],"equal":[93],"or":[94],"better":[95],"objective":[96,100],"values":[97,101],"than":[98],"solutions.":[105],"The":[106],"results":[108],"also":[109],"enable":[110],"development":[112],"more":[114],"efficient":[115],"solution":[116],"methods":[117],"heuristic":[119],"approaches":[120],"considered":[123],"problems;":[124],"this":[125,134],"potential":[126],"is":[127],"addressed":[128],"last":[131],"part":[132],"article.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2025-12-24T23:09:58.560324","created_date":"2025-10-10T00:00:00"}