{"id":"https://openalex.org/W4226549354","doi":"https://doi.org/10.1007/s12532-023-00241-9","title":"Efficient MIP techniques for computing the relaxation complexity","display_name":"Efficient MIP techniques for computing the relaxation complexity","publication_year":2023,"publication_date":"2023-04-11","ids":{"openalex":"https://openalex.org/W4226549354","doi":"https://doi.org/10.1007/s12532-023-00241-9"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-023-00241-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-023-00241-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-023-00241-9.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","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/s12532-023-00241-9.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":true,"raw_author_name":"Christopher Hojny","raw_affiliation_strings":["Combinatorial Optimization Group, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-5324-8996","affiliations":[{"raw_affiliation_string":"Combinatorial Optimization Group, Eindhoven University of Technology, P.O. Box 513, 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"],"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/A5042636612"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":3390,"currency":"USD","value_usd":3390},"apc_paid":{"value":3390,"currency":"USD","value_usd":3390},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01086016,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"3","first_page":"549","last_page":"580"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.47870001196861267,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.47870001196861267,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.14499999582767487,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.1379999965429306,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.7615258097648621},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7075998783111572},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.686650812625885},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6225789785385132},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6202849745750427},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5864733457565308},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5280269980430603},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.4776265025138855},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.462067186832428},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43719756603240967},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4178253412246704},{"id":"https://openalex.org/keywords/symmetry","display_name":"Symmetry (geometry)","score":0.4146490693092346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4111478328704834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4032021760940552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24670380353927612}],"concepts":[{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.7615258097648621},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7075998783111572},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.686650812625885},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6225789785385132},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6202849745750427},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5864733457565308},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5280269980430603},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.4776265025138855},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.462067186832428},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43719756603240967},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4178253412246704},{"id":"https://openalex.org/C2779886137","wikidata":"https://www.wikidata.org/wiki/Q21030012","display_name":"Symmetry (geometry)","level":2,"score":0.4146490693092346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4111478328704834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4032021760940552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24670380353927612},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s12532-023-00241-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-023-00241-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-023-00241-9.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/ab3b1576-3047-44f2-888b-a3878cb41dde","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85152459059&partnerID=8YFLogxK","pdf_url":"https://pure.tue.nl/ws/files/305622095/s12532-023-00241-9.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, 'Efficient MIP techniques for computing the relaxation complexity', Mathematical Programming Computation, vol. 15, no. 3, pp. 549-580. https://doi.org/10.1007/s12532-023-00241-9","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:openaire/ab3b1576-3047-44f2-888b-a3878cb41dde","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/ab3b1576-3047-44f2-888b-a3878cb41dde","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":"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, 'Efficient MIP techniques for computing the relaxation complexity', Mathematical Programming Computation, vol. 15, no. 3, pp. 549-580. https://doi.org/10.1007/s12532-023-00241-9","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/ab3b1576-3047-44f2-888b-a3878cb41dde","is_oa":true,"landing_page_url":"https://research.tue.nl/files/305622095/s12532-023-00241-9.pdf","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":"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, 'Efficient MIP techniques for computing the relaxation complexity', Mathematical Programming Computation, vol. 15, no. 3, pp. 549-580. https://doi.org/10.1007/s12532-023-00241-9","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s12532-023-00241-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-023-00241-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-023-00241-9.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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 Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4226549354.pdf","grobid_xml":"https://content.openalex.org/works/W4226549354.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1481810791","https://openalex.org/W1563600186","https://openalex.org/W1680201399","https://openalex.org/W1994799860","https://openalex.org/W2053113791","https://openalex.org/W2076045504","https://openalex.org/W2076451537","https://openalex.org/W2115718900","https://openalex.org/W2161685929","https://openalex.org/W2199025894","https://openalex.org/W2337855014","https://openalex.org/W2788332637","https://openalex.org/W2963170064","https://openalex.org/W2995196401","https://openalex.org/W3046357074","https://openalex.org/W3129155655","https://openalex.org/W3133357590","https://openalex.org/W3165437617","https://openalex.org/W4296397896","https://openalex.org/W4384200885","https://openalex.org/W6927164325","https://openalex.org/W6969137487"],"related_works":["https://openalex.org/W634918","https://openalex.org/W13901337","https://openalex.org/W9970806","https://openalex.org/W6467814","https://openalex.org/W4060530","https://openalex.org/W1959047","https://openalex.org/W5558630","https://openalex.org/W12728619","https://openalex.org/W3795022","https://openalex.org/W12919302"],"abstract_inverted_index":{"Abstract":[0],"The":[1,113],"relaxation":[2,76,111],"complexity":[3],"$${{\\,\\textrm{rc}\\,}}(X)$$":[4],"rc":[5],"(":[6],"X":[7,15,34],")":[8],"of":[9,12,24,51,74,103,108,115],"the":[10,21,75,101],"set":[11,124],"integer":[13,43],"points":[14],"contained":[16],"in":[17,42,49,106],"a":[18,29,67,121],"polyhedron":[19],"is":[20,118,126],"minimal":[22],"number":[23],"inequalities":[25],"needed":[26],"to":[27,65,131],"formulate":[28],"linear":[30],"optimization":[31],"problem":[32],"over":[33],"without":[35],"using":[36],"auxiliary":[37],"variables.":[38],"Besides":[39],"its":[40],"relevance":[41],"programming,":[44],"this":[45],"concept":[46],"has":[47],"interpretations":[48],"aspects":[50],"social":[52],"choice,":[53],"symmetric":[54],"cryptanalysis,":[55],"and":[56,69,87,94,125],"machine":[57],"learning.":[58],"We":[59],"employ":[60],"efficient":[61],"mixed-integer":[62],"programming":[63],"techniques":[64,86],"compute":[66],"robust":[68],"numerically":[70],"more":[71],"practical":[72],"variant":[73],"complexity.":[77],"Our":[78],"proposed":[79],"models":[80,105,117],"require":[81],"row":[82],"or":[83],"column":[84],"generation":[85],"can":[88],"be":[89,138],"enhanced":[90],"by":[91,128],"symmetry":[92],"handling":[93],"suitable":[95],"propagation":[96],"algorithms.":[97],"Theoretically,":[98],"we":[99],"compare":[100],"quality":[102],"our":[104],"terms":[107],"their":[109,129],"LP":[110],"values.":[112],"performance":[114],"those":[116],"investigated":[119],"on":[120],"broad":[122],"test":[123],"underlined":[127],"ability":[130],"solve":[132],"challenging":[133],"instances":[134],"that":[135],"could":[136],"not":[137],"solved":[139],"previously.":[140]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2022-05-05T00:00:00"}