{"id":"https://openalex.org/W2527757967","doi":"https://doi.org/10.1080/10556788.2017.1322081","title":"A framework for solving mixed-integer semidefinite programs","display_name":"A framework for solving mixed-integer semidefinite programs","publication_year":2017,"publication_date":"2017-05-16","ids":{"openalex":"https://openalex.org/W2527757967","doi":"https://doi.org/10.1080/10556788.2017.1322081","mag":"2527757967"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2017.1322081","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1322081","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056909605","display_name":"Tristan Gally","orcid":"https://orcid.org/0000-0003-2990-3273"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tristan Gally","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"],"raw_orcid":"https://orcid.org/0000-0003-2990-3273","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033982876","display_name":"Marc E. Pfetsch","orcid":"https://orcid.org/0000-0002-0947-7193"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marc E. Pfetsch","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":null,"display_name":"Stefan Ulbrich","orcid":"https://orcid.org/0000-0003-3890-9853"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Ulbrich","raw_affiliation_strings":["Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3890-9853","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056909605"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":9.6851,"has_fulltext":false,"cited_by_count":83,"citation_normalized_percentile":{"value":0.98838359,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"33","issue":"3","first_page":"594","last_page":"632"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9987999796867371,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9800000190734863,"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/T10142","display_name":"Formal Methods in Verification","score":0.9628999829292297,"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/solver","display_name":"Solver","score":0.8533776998519897},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.8261781930923462},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7188001275062561},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.6783131957054138},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6239283680915833},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6104321479797363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5844631791114807},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5625907182693481},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4632386565208435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3478037714958191},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.2665196359157562},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1779187023639679},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.07843461632728577}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8533776998519897},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8261781930923462},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7188001275062561},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.6783131957054138},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6239283680915833},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6104321479797363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5844631791114807},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5625907182693481},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4632386565208435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3478037714958191},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.2665196359157562},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1779187023639679},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.07843461632728577},{"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.1080/10556788.2017.1322081","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1322081","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:96438","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/96438/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Artikel"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":71,"referenced_works":["https://openalex.org/W4701811","https://openalex.org/W193768022","https://openalex.org/W1509805685","https://openalex.org/W1512175223","https://openalex.org/W1534573459","https://openalex.org/W1539191226","https://openalex.org/W1553621070","https://openalex.org/W1575923498","https://openalex.org/W1581428370","https://openalex.org/W1590002045","https://openalex.org/W1602308653","https://openalex.org/W1632601927","https://openalex.org/W1964191135","https://openalex.org/W1968077632","https://openalex.org/W1970065252","https://openalex.org/W1985123706","https://openalex.org/W1994932713","https://openalex.org/W2004489140","https://openalex.org/W2014328192","https://openalex.org/W2021008323","https://openalex.org/W2021640942","https://openalex.org/W2022004439","https://openalex.org/W2023349184","https://openalex.org/W2033498477","https://openalex.org/W2033735555","https://openalex.org/W2035238076","https://openalex.org/W2041252457","https://openalex.org/W2047121735","https://openalex.org/W2051306216","https://openalex.org/W2060514920","https://openalex.org/W2076039085","https://openalex.org/W2077688031","https://openalex.org/W2078979423","https://openalex.org/W2080359169","https://openalex.org/W2087684630","https://openalex.org/W2090084096","https://openalex.org/W2090236751","https://openalex.org/W2091364465","https://openalex.org/W2098304414","https://openalex.org/W2106106289","https://openalex.org/W2106871914","https://openalex.org/W2109445739","https://openalex.org/W2117457604","https://openalex.org/W2124892043","https://openalex.org/W2127300249","https://openalex.org/W2136931788","https://openalex.org/W2149454052","https://openalex.org/W2150285483","https://openalex.org/W2151251825","https://openalex.org/W2158598102","https://openalex.org/W2182449132","https://openalex.org/W2222122796","https://openalex.org/W2227764400","https://openalex.org/W2249693094","https://openalex.org/W2284124482","https://openalex.org/W2317866228","https://openalex.org/W2418368257","https://openalex.org/W2505968561","https://openalex.org/W2536620281","https://openalex.org/W2557918589","https://openalex.org/W2611709461","https://openalex.org/W2724786773","https://openalex.org/W2917843279","https://openalex.org/W4229666556","https://openalex.org/W4232585008","https://openalex.org/W4240374930","https://openalex.org/W4242184967","https://openalex.org/W4243539849","https://openalex.org/W4251616545","https://openalex.org/W4285719527","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2385886188","https://openalex.org/W2288891047","https://openalex.org/W2524928742","https://openalex.org/W2362452378","https://openalex.org/W2353517195","https://openalex.org/W3166939022","https://openalex.org/W2023211170","https://openalex.org/W2544939111","https://openalex.org/W2386048074","https://openalex.org/W2572095861"],"abstract_inverted_index":{"Mixed-integer":[0],"semidefinite":[1,38,90],"programs":[2],"(MISDPs)":[3],"arise":[4],"in":[5],"many":[6],"applications":[7],"and":[8,54],"several":[9],"problem-specific":[10],"solution":[11],"approaches":[12],"have":[13],"been":[14],"studied":[15],"recently.":[16],"In":[17],"this":[18],"paper,":[19],"we":[20],"investigate":[21],"a":[22,105],"generic":[23],"branch-and-bound":[24],"framework":[25],"for":[26],"solving":[27],"such":[28,48],"problems.":[29,74],"We":[30,59],"first":[31],"show":[32,60,77],"that":[33,96],"strict":[34],"duality":[35],"of":[36,63,66,73,82],"the":[37,43,61,67,78,83,89],"relaxations":[39],"is":[40],"inherited":[41],"to":[42],"subproblems.":[44],"Then":[45],"solver":[46,85,92],"components":[47],"as":[49],"dual":[50],"fixing,":[51],"branching":[52],"rules,":[53],"primal":[55],"heuristics":[56],"are":[57],"presented.":[58],"applicability":[62],"an":[64],"implementation":[65],"proposed":[68],"methods":[69],"on":[70,88],"three":[71],"kinds":[72],"The":[75],"results":[76],"positive":[79],"computational":[80],"impact":[81],"different":[84],"components,":[86],"depending":[87],"programming":[91],"used.":[93],"This":[94],"demonstrates":[95],"practically":[97],"relevant":[98],"MISDPs":[99],"can":[100],"successfully":[101],"be":[102],"solved":[103],"using":[104],"general":[106],"purpose":[107],"solver.":[108]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}