{"id":"https://openalex.org/W4407155105","doi":"https://doi.org/10.1109/tcns.2025.3538472","title":"Mixed-Integer Linear Programming Approaches for Tree Partitioning of Power Networks","display_name":"Mixed-Integer Linear Programming Approaches for Tree Partitioning of Power Networks","publication_year":2025,"publication_date":"2025-02-04","ids":{"openalex":"https://openalex.org/W4407155105","doi":"https://doi.org/10.1109/tcns.2025.3538472"},"language":"en","primary_location":{"id":"doi:10.1109/tcns.2025.3538472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcns.2025.3538472","pdf_url":null,"source":{"id":"https://openalex.org/S2502544478","display_name":"IEEE Transactions on Control of Network Systems","issn_l":"2325-5870","issn":["2325-5870","2372-2533"],"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 Control of Network Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.vu.nl/en/publications/e6ea9b9d-4d2b-4d03-8012-95e07dee2c04","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004301934","display_name":"Leon Lan","orcid":"https://orcid.org/0000-0001-7479-0218"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Leon Lan","raw_affiliation_strings":["Department of Mathematics, Vrije Universiteit, Amsterdam, Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-7479-0218","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Vrije Universiteit, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029411937","display_name":"Alessandro Zocca","orcid":"https://orcid.org/0000-0001-6585-4785"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alessandro Zocca","raw_affiliation_strings":["Department of Mathematics, Vrije Universiteit, Amsterdam, Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-6585-4785","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Vrije Universiteit, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I865915315"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01002744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"2","first_page":"1805","last_page":"1814"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/integer-programming","display_name":"Integer programming","score":0.7424419522285461},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5996268391609192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5776745080947876},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5137770771980286},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5079172253608704},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49148452281951904},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.44651851058006287},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3236587643623352},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3089895248413086},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30533289909362793},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13161346316337585}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7424419522285461},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5996268391609192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5776745080947876},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5137770771980286},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5079172253608704},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49148452281951904},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.44651851058006287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3236587643623352},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3089895248413086},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30533289909362793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13161346316337585},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tcns.2025.3538472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcns.2025.3538472","pdf_url":null,"source":{"id":"https://openalex.org/S2502544478","display_name":"IEEE Transactions on Control of Network Systems","issn_l":"2325-5870","issn":["2325-5870","2372-2533"],"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 Control of Network Systems","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire/e6ea9b9d-4d2b-4d03-8012-95e07dee2c04","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/e6ea9b9d-4d2b-4d03-8012-95e07dee2c04","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lan, L & Zocca, A 2025, 'Mixed-integer Linear Programming Approaches for Tree Partitioning of Power Networks', IEEE Transactions on Control of Network Systems, vol. 12, no. 2, pp. 1805-1814. https://doi.org/10.1109/TCNS.2025.3538472","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:research.vu.nl:openaire/e6ea9b9d-4d2b-4d03-8012-95e07dee2c04","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/e6ea9b9d-4d2b-4d03-8012-95e07dee2c04","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lan, L & Zocca, A 2025, 'Mixed-integer Linear Programming Approaches for Tree Partitioning of Power Networks', IEEE Transactions on Control of Network Systems, vol. 12, no. 2, pp. 1805-1814. https://doi.org/10.1109/TCNS.2025.3538472","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1428692660","https://openalex.org/W1791071580","https://openalex.org/W1909467347","https://openalex.org/W1945760464","https://openalex.org/W1982204033","https://openalex.org/W1982226497","https://openalex.org/W1992454573","https://openalex.org/W2001647331","https://openalex.org/W2070747829","https://openalex.org/W2082183509","https://openalex.org/W2109376283","https://openalex.org/W2124562375","https://openalex.org/W2130016132","https://openalex.org/W2178319414","https://openalex.org/W2342705924","https://openalex.org/W2772048350","https://openalex.org/W2789408321","https://openalex.org/W2964145335","https://openalex.org/W3154775437","https://openalex.org/W3169727715","https://openalex.org/W4236185661","https://openalex.org/W4254505309","https://openalex.org/W4285250805","https://openalex.org/W4285792003","https://openalex.org/W4327704832","https://openalex.org/W6766338240","https://openalex.org/W6795199559"],"related_works":["https://openalex.org/W4302819359","https://openalex.org/W2769220156","https://openalex.org/W4210880521","https://openalex.org/W2769538987","https://openalex.org/W2941114593","https://openalex.org/W2995925505","https://openalex.org/W1711527768","https://openalex.org/W3116484972","https://openalex.org/W2044902158","https://openalex.org/W2773399470"],"abstract_inverted_index":{"In":[0,38,116],"transmission":[1],"networks,":[2],"power":[3,13,54,80],"flows":[4],"and":[5,83,94,129,171],"network":[6,24,60,84],"topology":[7],"are":[8],"deeply":[9],"intertwined":[10],"due":[11],"to":[12,49,124,143,186],"flow":[14,81],"physics.":[15],"Recent":[16],"literature":[17],"shows":[18],"that":[19],"a":[20,40,92,104,120,132,179],"specific":[21],"more":[22],"hierarchical":[23],"structure":[25],"can":[26,177],"effectively":[27],"inhibit":[28],"the":[29,35,51,150,165,187],"propagation":[30],"of":[31,53,153,167],"line":[32],"failures":[33],"across":[34],"entire":[36],"system.":[37],"particular,":[39,117],"novel":[41,121],"approach":[42,96],"namedtree":[43],"partitioninghas":[44],"been":[45,72,98],"proposed,":[46],"which":[47,79],"seeks":[48],"bolster":[50],"robustness":[52],"networks":[55],"through":[56,158],"strategic":[57],"alterations":[58],"in":[59,182],"topology,":[61],"accomplished":[62],"via":[63],"targeted":[64],"line-switching":[65],"actions.":[66],"Several":[67],"tree-partitioning":[68,108,127,146,169],"problem":[69,147],"formulations":[70],"have":[71,97],"proposed":[73],"by":[74],"considering":[75],"different":[76],"objectives,":[77],"among":[78],"disruption":[82],"congestion.":[85],"Furthermore,":[86],"various":[87,168],"heuristic":[88,134],"methods":[89],"based":[90,110,135],"on":[91,111,136,174],"two-stage":[93,133],"recursive":[95],"proposed.":[99],"The":[100],"present":[101,119],"work":[102],"provides":[103],"general":[105],"framework":[106],"for":[107],"problems":[109,128],"mixed-integer":[112],"linear":[113],"programming":[114],"(MILP).":[115],"we":[118,163],"MILP":[122],"formulation":[123],"optimally":[125],"solve":[126,144],"also":[130],"propose":[131],"MILP.":[137],"We":[138],"perform":[139],"extensive":[140],"numerical":[141],"experiments":[142],"two":[145],"variants,":[148],"demonstrating":[149],"excellent":[151],"performance":[152],"our":[154],"solution":[155],"methods.":[156],"Lastly,":[157],"exhaustive":[159],"cascading":[160],"failure":[161],"simulations,":[162],"compare":[164],"effectiveness":[166],"strategies":[170],"show":[172],"that,":[173],"average,":[175],"they":[176],"achieve":[178],"substantial":[180],"reduction":[181],"lost":[183],"load":[184],"compared":[185],"original":[188],"topologies.":[189]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}