{"id":"https://openalex.org/W3165437617","doi":"https://doi.org/10.1007/s10107-021-01754-8","title":"Computational aspects of relaxation complexity: possibilities and limitations","display_name":"Computational aspects of relaxation complexity: possibilities and limitations","publication_year":2021,"publication_date":"2021-12-30","ids":{"openalex":"https://openalex.org/W3165437617","doi":"https://doi.org/10.1007/s10107-021-01754-8","mag":"3165437617"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-021-01754-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01754-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01754-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01754-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020875207","display_name":"Gennadiy Averkov","orcid":"https://orcid.org/0000-0003-2245-9958"},"institutions":[{"id":"https://openalex.org/I51783024","display_name":"Brandenburg University of Technology Cottbus-Senftenberg","ror":"https://ror.org/02wxx3e24","country_code":"DE","type":"education","lineage":["https://openalex.org/I51783024"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Gennadiy Averkov","raw_affiliation_strings":["BTU Cottbus-Senftenberg, Platz der Deutschen Einheit 1, 03046, Cottbus, Germany"],"affiliations":[{"raw_affiliation_string":"BTU Cottbus-Senftenberg, Platz der Deutschen Einheit 1, 03046, Cottbus, Germany","institution_ids":["https://openalex.org/I51783024"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042636612","display_name":"Christopher Hojny","orcid":"https://orcid.org/0000-0002-5324-8996"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Christopher Hojny","raw_affiliation_strings":["Eindhoven University of Technology Combinatorial Optimization Group, PO Box\u00a0513, 5600, MB, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology Combinatorial Optimization Group, PO Box\u00a0513, 5600, MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046794269","display_name":"Matthias Schymura","orcid":"https://orcid.org/0000-0001-5156-7953"},"institutions":[{"id":"https://openalex.org/I51783024","display_name":"Brandenburg University of Technology Cottbus-Senftenberg","ror":"https://ror.org/02wxx3e24","country_code":"DE","type":"education","lineage":["https://openalex.org/I51783024"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Schymura","raw_affiliation_strings":["BTU Cottbus-Senftenberg, Platz der Deutschen Einheit 1, 03046, Cottbus, Germany"],"affiliations":[{"raw_affiliation_string":"BTU Cottbus-Senftenberg, Platz der Deutschen Einheit 1, 03046, Cottbus, Germany","institution_ids":["https://openalex.org/I51783024"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020875207"],"corresponding_institution_ids":["https://openalex.org/I51783024"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.4525,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66981495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"197","issue":"2","first_page":"1173","last_page":"1200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9958000183105469,"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/algorithm","display_name":"Algorithm","score":0.6095137000083923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3641740679740906},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3274313807487488}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6095137000083923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3641740679740906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3274313807487488}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-021-01754-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01754-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01754-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/7d48075f-7383-4d34-b7c8-954a13d429cf","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/7d48075f-7383-4d34-b7c8-954a13d429cf","pdf_url":"https://pure.tue.nl/ws/files/277790121/s10107_021_01754_8.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Averkov, G, Hojny, C & Schymura, M 2023, 'Computational aspects of relaxation complexity: possibilities and limitations', Mathematical Programming, vol. 197, no. 2, pp. 1173-1200. https://doi.org/10.1007/s10107-021-01754-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/7d48075f-7383-4d34-b7c8-954a13d429cf","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85122080830&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Averkov, G, Hojny, C & Schymura, M 2023, 'Computational aspects of relaxation complexity: possibilities and limitations', Mathematical Programming, vol. 197, no. 2, pp. 1173-1200. https://doi.org/10.1007/s10107-021-01754-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/7d48075f-7383-4d34-b7c8-954a13d429cf","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/7d48075f-7383-4d34-b7c8-954a13d429cf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, 197(2), 1173 - 1200. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10107-021-01754-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-021-01754-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-021-01754-8.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3165437617.pdf","grobid_xml":"https://content.openalex.org/works/W3165437617.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W964151626","https://openalex.org/W1487872891","https://openalex.org/W1542485252","https://openalex.org/W1563088657","https://openalex.org/W1597014679","https://openalex.org/W1963534149","https://openalex.org/W1967232806","https://openalex.org/W1982373193","https://openalex.org/W1994799860","https://openalex.org/W2013817894","https://openalex.org/W2015438979","https://openalex.org/W2017921773","https://openalex.org/W2022266599","https://openalex.org/W2053113791","https://openalex.org/W2105188136","https://openalex.org/W2115718900","https://openalex.org/W2129889866","https://openalex.org/W2153196227","https://openalex.org/W2199025894","https://openalex.org/W2337855014","https://openalex.org/W2345492474","https://openalex.org/W2499865049","https://openalex.org/W2912877111","https://openalex.org/W2913056486","https://openalex.org/W2963170064","https://openalex.org/W3023950925","https://openalex.org/W3046357074","https://openalex.org/W3129155655","https://openalex.org/W3133357590","https://openalex.org/W3161949514","https://openalex.org/W4255609236","https://openalex.org/W4300568640","https://openalex.org/W6927164325"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"relaxation":[2],"complexity":[3],"$${{\\,\\mathrm{rc}\\,}}(X)$$":[4,105,135,168,274,308,339],"<mml:math":[5,81,106,136,169,199,220,235,275,309,340],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[6,82,107,137,170,200,221,236,276,310,341],"<mml:mrow>":[7,8,83,85,94,108,109,138,139,171,172,201,205,222,237,238,277,278,311,312,342,343],"<mml:mspace":[9,12,86,89,110,113,140,143,173,176,239,242,279,282,313,316,344,347],"/>":[10,13,87,90,111,114,141,144,174,177,240,243,280,283,314,317,345,348],"<mml:mi>rc</mml:mi>":[11,88,112,142,175,241,281,315,346],"</mml:mrow>":[14,18,91,98,99,115,119,145,149,178,182,207,210,226,244,250,284,288,318,322,349,353],"<mml:mo>(</mml:mo>":[15,95,116,146,179,245,285,319,350],"<mml:mi>X</mml:mi>":[16,96,117,147,180,225,246,286,320,351],"<mml:mo>)</mml:mo>":[17,97,118,148,181,247,287,321,352],"</mml:math>":[19,100,120,150,183,211,227,251,289,323,354],"of":[20,23,35,37,61,65,104,191,260,273,327],"the":[21,32,43,59,123,185,189,271,332],"set":[22,194,266],"integer":[24,44],"points":[25,45],"X":[26,50,66,158,215,261,329,357],"contained":[27],"in":[28,46,121,154],"a":[29,54,102,192,292,296,360],"polyhedron":[30,39],"is":[31,53,159],"smallest":[33],"number":[34],"facets":[36],"any":[38],"P":[40,47,125],"such":[41,212,264],"that":[42,134,213,262,358],"coincide":[48],"with":[49,184],".":[51,67,252],"It":[52],"useful":[55],"tool":[56],"to":[57,128,230,269,295,337],"investigate":[58,163],"existence":[60,190],"compact":[62],"linear":[63],"descriptions":[64],"In":[68,253],"this":[69],"article,":[70],"we":[71,132,162,255],"derive":[72],"tight":[73],"and":[74,131,216,330],"computable":[75,164],"upper":[76],"bounds":[77,166],"on":[78,167,188],"$${{\\,\\mathrm{rc}\\,}}_\\mathbb":[79],"{Q}(X)$$":[80],"<mml:msub>":[84],"<mml:mi>Q</mml:mi>":[92],"</mml:msub>":[93],",":[101,290],"variant":[103],"which":[122],"polyhedra":[124],"are":[126],"required":[127],"be":[129,152],"rational,":[130],"show":[133,256],"can":[151],"computed":[153],"polynomial":[155],"time":[156],"if":[157],"2-dimensional.":[160],"Further,":[161],"lower":[165],"particular":[186],"focus":[187],"finite":[193,265,361],"$$Y":[195,217],"\\subseteq":[196],"\\mathbb":[197],"{Z}^d$$":[198],"<mml:mi>Y</mml:mi>":[202,223],"<mml:mo>\u2286</mml:mo>":[203],"<mml:msup>":[204],"<mml:mi>Z</mml:mi>":[206],"<mml:mi>d</mml:mi>":[208],"</mml:msup>":[209],"separating":[214],"\\setminus":[218],"X$$":[219],"<mml:mo>\\</mml:mo>":[224],"allows":[228],"us":[229],"deduce":[231],"$${{\\,\\mathrm{rc}\\,}}(X)":[232],"\\ge":[233],"k$$":[234],"<mml:mo>\u2265</mml:mo>":[248],"<mml:mi>k</mml:mi>":[249],"particular,":[254],"for":[257,307,324,355],"some":[258],"choices":[259],"no":[263],"Y":[267],"exists":[268],"certify":[270],"value":[272],"providing":[291],"negative":[293],"answer":[294],"question":[297],"by":[298],"Weltge":[299],"(2015).":[300],"We":[301],"also":[302],"obtain":[303],"an":[304],"explicit":[305],"formula":[306],"specific":[325],"classes":[326],"sets":[328,356],"present":[331],"first":[333],"practically":[334],"applicable":[335],"approach":[336],"compute":[338],"admit":[359],"certificate.":[362]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}