{"id":"https://openalex.org/W4416381371","doi":"https://doi.org/10.1109/access.2025.3631528","title":"Efficient Surgical Kit Configuration via MILP and Graph-Based Clustering Heuristics","display_name":"Efficient Surgical Kit Configuration via MILP and Graph-Based Clustering Heuristics","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416381371","doi":"https://doi.org/10.1109/access.2025.3631528"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3631528","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3631528","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3631528","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108935406","display_name":"Shayane Da Silva Carvalho","orcid":"https://orcid.org/0009-0007-4923-8545"},"institutions":[{"id":"https://openalex.org/I2799978770","display_name":"X-Fab (Germany)","ror":"https://ror.org/030bh9196","country_code":"DE","type":"company","lineage":["https://openalex.org/I2799978770"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Shayane Da Silva Carvalho","raw_affiliation_strings":["Instituto de Ciências Matemáticas e de Computação, São Carlos, Brazil"],"raw_orcid":"https://orcid.org/0009-0007-4923-8545","affiliations":[{"raw_affiliation_string":"Instituto de Ciências Matemáticas e de Computação, São Carlos, Brazil","institution_ids":["https://openalex.org/I2799978770"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086790392","display_name":"Maristela Oliveira dos Santos","orcid":"https://orcid.org/0000-0003-0822-3439"},"institutions":[{"id":"https://openalex.org/I2799978770","display_name":"X-Fab (Germany)","ror":"https://ror.org/030bh9196","country_code":"DE","type":"company","lineage":["https://openalex.org/I2799978770"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maristela Oliveira Santos","raw_affiliation_strings":["Instituto de Ciências Matemáticas e de Computação, São Carlos, Brazil"],"raw_orcid":"https://orcid.org/0000-0003-0822-3439","affiliations":[{"raw_affiliation_string":"Instituto de Ciências Matemáticas e de Computação, São Carlos, Brazil","institution_ids":["https://openalex.org/I2799978770"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076854781","display_name":"Mari\u00e1 C. V. Nascimento","orcid":"https://orcid.org/0000-0002-3094-6847"},"institutions":[{"id":"https://openalex.org/I107428990","display_name":"Instituto Tecnol\u00f3gico de Aeron\u00e1utica","ror":"https://ror.org/05vh67662","country_code":"BR","type":"education","lineage":["https://openalex.org/I107428990"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Mari\u00e1 Cristina Vasconcelos Nascimento","raw_affiliation_strings":["Instituto Tecnológico de Aeronáutica, São José dos Campos, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-3094-6847","affiliations":[{"raw_affiliation_string":"Instituto Tecnológico de Aeronáutica, São José dos Campos, Brazil","institution_ids":["https://openalex.org/I107428990"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.47439386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":null,"first_page":"192906","last_page":"192919"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11773","display_name":"Healthcare Operations and Scheduling Optimization","score":0.7479000091552734,"subfield":{"id":"https://openalex.org/subfields/3604","display_name":"Emergency Medical Services"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T11773","display_name":"Healthcare Operations and Scheduling Optimization","score":0.7479000091552734,"subfield":{"id":"https://openalex.org/subfields/3604","display_name":"Emergency Medical Services"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.04019999876618385,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.02590000070631504,"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/heuristics","display_name":"Heuristics","score":0.8259999752044678},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7716000080108643},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5717999935150146},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5633999705314636},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5547000169754028},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5432000160217285},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.486299991607666},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4693000018596649}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8259999752044678},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7716000080108643},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7710999846458435},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5717999935150146},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5633999705314636},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5547000169754028},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5432000160217285},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.486299991607666},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4693000018596649},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4156000018119812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38339999318122864},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.38280001282691956},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.326200008392334},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.25450000166893005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2542000114917755},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3631528","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3631528","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:79ae0d2c122a43a38fb6c8e8a766a499","is_oa":true,"landing_page_url":"https://doaj.org/article/79ae0d2c122a43a38fb6c8e8a766a499","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 13, Pp 192906-192919 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3631528","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3631528","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3989521460","display_name":null,"funder_award_id":"307466/2021-3","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G4985541372","display_name":null,"funder_award_id":"309385/2021-0","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G5285099086","display_name":null,"funder_award_id":"1008867 (Process 18.1.00779.55.4)","funder_id":"https://openalex.org/F4320330880","funder_display_name":"Santa Casa da Miseric\u00f3rdia de Lisboa"},{"id":"https://openalex.org/G5990746028","display_name":null,"funder_award_id":"2013/07375-0","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"},{"id":"https://openalex.org/G6132555478","display_name":null,"funder_award_id":"2022/05803-3","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"},{"id":"https://openalex.org/G707717154","display_name":null,"funder_award_id":"403735/2021-1","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320330880","display_name":"Santa Casa da Miseric\u00f3rdia de Lisboa","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,85],"formation":[1],"of":[2,29,167],"surgical":[3,30],"kits":[4,25,40,169],"is":[5,37],"essential":[6],"for":[7,125],"efficient":[8],"resource":[9],"management":[10],"in":[11,82,170],"hospitals.":[12],"This":[13],"problem":[14],"involves":[15],"determining":[16],"the":[17,27,108,117,123,149,154],"appropriate":[18],"items":[19],"and":[20,75,153],"quantities":[21],"to":[22,79],"ensure":[23],"that":[24,41,61,107,133],"meet":[26],"demands":[28,44],"procedures":[31,46],"without":[32,47],"shortages.":[33],"A":[34],"key":[35],"challenge":[36],"designing":[38],"shared":[39,83,113,168],"fulfill":[42],"overlapping":[43],"across":[45],"including":[48,68],"excess":[49],"items,":[50],"which":[51],"may":[52],"be":[53],"discarded":[54],"once":[55],"deemed":[56],"contaminated.":[57],"Unlike":[58],"existing":[59],"approaches":[60],"allow":[62],"oversupply,":[63],"we":[64],"propose":[65],"optimization-based":[66],"methods,":[67],"a":[69,76,89,103,145,164],"mixed-integer":[70],"linear":[71],"programming":[72],"model":[73,152],"(MILP)":[74],"two-stage":[77],"heuristic,":[78],"minimize":[80],"surplus":[81],"kits.":[84],"first":[86],"stage":[87],"applies":[88],"biclique":[90],"enumeration":[91],"framework":[92],"from":[93,102],"bipartite":[94],"graph":[95],"clustering.":[96],"Computational":[97],"experiments":[98],"using":[99,148],"real":[100],"data":[101],"Brazilian":[104],"hospital":[105],"demonstrate":[106],"proposed":[109,150],"methods":[110],"effectively":[111],"identify":[112],"kit":[114],"compositions.":[115],"Although":[116],"heuristic":[118,155],"yielded":[119],"lower-quality":[120],"solutions":[121,159,162],"than":[122],"solver":[124,147],"larger":[126],"instances,":[127],"it":[128],"successfully":[129],"uncovered":[130],"meaningful":[131],"patterns":[132],"offer":[134],"valuable":[135],"insights":[136],"andwarrant":[137],"further":[138],"exploration.":[139],"In":[140],"addition,":[141],"tests":[142],"conducted":[143],"with":[144,163],"commercial":[146],"mathematical":[151],"results":[156],"as":[157],"initial":[158],"revealed":[160],"alternative":[161],"higher":[165],"number":[166],"certain":[171],"instances.":[172]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-11T00:00:00"}