{"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":false,"raw_author_name":"Gennadiy Averkov","raw_affiliation_strings":["BTU Cottbus-Senftenberg, Platz der Deutschen Einheit 1, 03046, Cottbus, Germany"],"raw_orcid":"https://orcid.org/0000-0003-2245-9958","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 513, 5600, MB, Eindhoven, The Netherlands","Eindhoven University of Technology Combinatorial Optimization Group, PO Box\u00a0513, 5600, MB, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-5324-8996","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology Combinatorial Optimization Group, PO Box 513, 5600, MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"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":true,"raw_author_name":"Matthias Schymura","raw_affiliation_strings":["BTU Cottbus-Senftenberg, Platz der Deutschen Einheit 1, 03046, Cottbus, Germany"],"raw_orcid":"https://orcid.org/0000-0001-5156-7953","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":2,"corresponding_author_ids":["https://openalex.org/A5046794269"],"corresponding_institution_ids":["https://openalex.org/I51783024"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":{"value":3090,"currency":"USD","value_usd":3090},"fwci":0.3967,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64050665,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","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/article"},{"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/article"},{"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,77,96,118,188,211,231],"rc":[5,68,78,97,119,160,189,212,232],"(":[6,70,79,98,120,161,190,213,233],"X":[7,15,71,80,99,108,121,145,152,162,175,191,214,221,234,238],")":[8,72,81,100,122,163,192,215,235],"of":[9,12,24,26,49,53,76,130,174,187,219],"the":[10,21,32,47,84,124,128,185,224],"set":[11,133,180],"integer":[13,33],"points":[14,34],"contained":[16],"in":[17,35,82,104],"a":[18,42,74,131,195,199,241],"polyhedron":[19,28],"is":[20,41,109],"smallest":[22],"number":[23],"facets":[25],"any":[27],"P":[29,36,86],"such":[30,142,178],"that":[31,95,143,176,239],"coincide":[37],"with":[38,123],"X.":[39,54],"It":[40],"useful":[43],"tool":[44],"to":[45,89,155,183,198,229],"investigate":[46,113],"existence":[48,129],"compact":[50],"linear":[51],"descriptions":[52],"In":[55,167],"this":[56],"article,":[57],"we":[58,93,112,169],"derive":[59],"tight":[60],"and":[61,92,146,222],"computable":[62,114],"upper":[63],"bounds":[64,116],"on":[65,117,127],"$${{\\,\\mathrm{rc}\\,}}_\\mathbb":[66],"{Q}(X)$$":[67],"Q":[69],",":[73,193],"variant":[75],"which":[83],"polyhedra":[85],"are":[87],"required":[88],"be":[90,102],"rational,":[91],"show":[94,170],"can":[101],"computed":[103],"polynomial":[105],"time":[106],"if":[107],"2-dimensional.":[110],"Further,":[111],"lower":[115],"particular":[125],"focus":[126],"finite":[132,179,242],"$$Y":[134,147],"\\subseteq":[135],"\\mathbb":[136],"{Z}^d$$":[137],"Y":[138,150,181],"\u2286":[139],"Z":[140],"d":[141],"separating":[144],"\\setminus":[148],"X$$":[149],"\\":[151],"allows":[153],"us":[154],"deduce":[156],"$${{\\,\\mathrm{rc}\\,}}(X)":[157],"\\ge":[158],"k$$":[159],"\u2265":[164],"k":[165],".":[166],"particular,":[168],"for":[171,210,216,236],"some":[172],"choices":[173],"no":[177],"exists":[182],"certify":[184],"value":[186],"providing":[194],"negative":[196],"answer":[197],"question":[200],"by":[201],"Weltge":[202],"(2015).":[203],"We":[204],"also":[205],"obtain":[206],"an":[207],"explicit":[208],"formula":[209],"specific":[217],"classes":[218],"sets":[220,237],"present":[223],"first":[225],"practically":[226],"applicable":[227],"approach":[228],"compute":[230],"admit":[240],"certificate.":[243]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}