{"id":"https://openalex.org/W2045734922","doi":"https://doi.org/10.1137/s1052623497318682","title":"Decomposing Matrices into Blocks","display_name":"Decomposing Matrices into Blocks","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2045734922","doi":"https://doi.org/10.1137/s1052623497318682","mag":"2045734922"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623497318682","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623497318682","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.1137/S1052623497318682","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018583855","display_name":"Ralf Bornd\u00f6rfer","orcid":"https://orcid.org/0000-0001-7223-9174"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ralf Bornd\u00f6rfer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103212438","display_name":"Carlos Eduardo Ferreira","orcid":"https://orcid.org/0000-0003-4804-5788"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carlos E. Ferreira","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006197528","display_name":"Alexander Mart\u00edn","orcid":"https://orcid.org/0000-0001-7602-3653"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Martin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018583855"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7755,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.9190969,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"236","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"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.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7218433618545532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7137368321418762},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.621633768081665},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5637856125831604},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5560464859008789},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5442885756492615},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4971452057361603},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4942619800567627},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.49261265993118286},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.47228699922561646},{"id":"https://openalex.org/keywords/row-and-column-spaces","display_name":"Row and column spaces","score":0.471672385931015},{"id":"https://openalex.org/keywords/integer-matrix","display_name":"Integer matrix","score":0.4641842246055603},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.46306174993515015},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4268854260444641},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4139828383922577},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4095839858055115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3681532144546509},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31403616070747375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2001272737979889},{"id":"https://openalex.org/keywords/symmetric-matrix","display_name":"Symmetric matrix","score":0.11968672275543213},{"id":"https://openalex.org/keywords/nonnegative-matrix","display_name":"Nonnegative matrix","score":0.0655255913734436}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7218433618545532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7137368321418762},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.621633768081665},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5637856125831604},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5560464859008789},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5442885756492615},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4971452057361603},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4942619800567627},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.49261265993118286},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.47228699922561646},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.471672385931015},{"id":"https://openalex.org/C62555958","wikidata":"https://www.wikidata.org/wiki/Q6042601","display_name":"Integer matrix","level":5,"score":0.4641842246055603},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.46306174993515015},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4268854260444641},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4139828383922577},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4095839858055115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3681532144546509},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31403616070747375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2001272737979889},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.11968672275543213},{"id":"https://openalex.org/C139018669","wikidata":"https://www.wikidata.org/wiki/Q6961560","display_name":"Nonnegative matrix","level":4,"score":0.0655255913734436},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623497318682","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623497318682","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:001084469","is_oa":true,"landing_page_url":"https://doi.org/10.1137/S1052623497318682","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"reponame:Reposit\u00f3rio Institucional da USP (Biblioteca Digital da Produ\u00e7\u00e3o Intelectual)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:001084469","is_oa":true,"landing_page_url":"https://doi.org/10.1137/S1052623497318682","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"reponame:Reposit\u00f3rio Institucional da USP (Biblioteca Digital da Produ\u00e7\u00e3o Intelectual)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1486733264","https://openalex.org/W1505477491","https://openalex.org/W1584568876","https://openalex.org/W1963547452","https://openalex.org/W1970394924","https://openalex.org/W1995658164","https://openalex.org/W2006934540","https://openalex.org/W2011039300","https://openalex.org/W2014906426","https://openalex.org/W2031216525","https://openalex.org/W2031595762","https://openalex.org/W2039086748","https://openalex.org/W2052602889","https://openalex.org/W2055270936","https://openalex.org/W2055427220","https://openalex.org/W2082591111","https://openalex.org/W2090236751","https://openalex.org/W2091502736","https://openalex.org/W2095117703","https://openalex.org/W2100440346","https://openalex.org/W2114030927","https://openalex.org/W2158598102","https://openalex.org/W2170021258","https://openalex.org/W2249508874","https://openalex.org/W2476096155","https://openalex.org/W4235891679","https://openalex.org/W4285719527","https://openalex.org/W4293860921"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W4252122881","https://openalex.org/W4302819359","https://openalex.org/W2769220156","https://openalex.org/W2769538987","https://openalex.org/W4300803591","https://openalex.org/W1981350060","https://openalex.org/W134055995","https://openalex.org/W3162425430","https://openalex.org/W2121510931"],"abstract_inverted_index":{"In":[0,133],"this":[1,105],"paper":[2],"we":[3,29,155],"investigate":[4,156],"whether":[5],"matrices":[6,87],"arising":[7],"from":[8,88],"linear":[9,78,90],"or":[10,111],"integer":[11,80,94,169,187],"programming":[12,81,91,95,170],"problems":[13],"can":[14,69,100],"be":[15,102],"decomposed":[16,103],"into":[17,104,163],"so-called":[18],"bordered":[19,164],"block":[20,62,165],"diagonal":[21,63,166],"form.":[22],"More":[23],"precisely,":[24],"given":[25],"some":[26,39],"matrix":[27,130,161],"A,":[28],"try":[30],"to":[31,38,53,140,175],"assign":[32],"as":[33,36],"many":[34],"rows":[35,51],"possible":[37],"number":[40],"$\\beta$":[41],"of":[42,44,128,159],"blocks":[43,55],"size":[45],"$\\kappa$":[46],"such":[47,173],"that":[48,85],"no":[49],"two":[50],"assigned":[52],"different":[54],"intersect":[56],"in":[57,180],"a":[58,121,142,181],"common":[59],"column.":[60],"Bordered":[61],"form":[64,106,167],"is":[65],"desirable":[66],"because":[67],"it":[68],"guide":[70,176],"and":[71,79,92,98,150],"speed":[72],"up":[73],"the":[74,89,129,157,177],"solution":[75],"process":[76,179],"for":[77,168,184],"problems.":[82],"We":[83,145],"show":[84],"various":[86],"mixed":[93,186],"libraries":[96],"Netlib":[97],"Miplib":[99],"indeed":[101],"by":[107,171],"computing":[108],"optimal":[109,160],"decompositions":[110,112,162,174],"with":[113,120],"proven":[114],"quality.":[115],"These":[116],"computations":[117],"are":[118],"done":[119],"branch-and-cut":[122,182],"algorithm":[123],"based":[124],"on":[125],"polyhedral":[126],"investigations":[127],"decomposition":[131],"problem.":[132],"practice,":[134],"however,":[135],"one":[136],"would":[137],"use":[138],"heuristics":[139],"find":[141],"good":[143],"decomposition.":[144],"present":[146],"several":[147],"heuristic":[148],"ideas":[149],"test":[151],"their":[152],"performance.":[153],"Finally,":[154],"usefulness":[158],"using":[172],"branching":[178],"code":[183],"general":[185],"programs.":[188]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}