{"id":"https://openalex.org/W7213385752","doi":null,"title":"A Direct SDP Approach for Constrained Quadratic Binary Optimization Problems","display_name":"A Direct SDP Approach for Constrained Quadratic Binary Optimization Problems","publication_year":2026,"publication_date":"2026-08-25","ids":{"openalex":"https://openalex.org/W7213385752"},"language":"en","primary_location":{"id":"pmh:oai:d.cobiss.net/repository/si:290903555","doi":null,"is_oa":true,"landing_page_url":"https://github.com/Rudolfovoorg/A-Direct-SDP-Approach-for-QBOs","pdf_url":null,"source":{"id":"https://openalex.org/S7407055177","display_name":"dCOBISS.SI Digital Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"info:eu-repo/semantics/publishedVersion"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://github.com/Rudolfovoorg/A-Direct-SDP-Approach-for-QBOs","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5148124762","display_name":"MilaNedic","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nedi\u0107, Mila","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5148052987","display_name":"Zvmcevap","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zupanc, Beno","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.72999004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9961000084877014,"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.9961000084877014,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.002899999963119626,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/semidefinite-relaxation","display_name":"semidefinite relaxation","score":0.9589999914169312},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"triangle inequality","score":0.871999979019165},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.8349999785423279},{"id":"https://openalex.org/keywords/maximum-independent-set-problem","display_name":"maximum independent set","score":0.9340000152587891},{"id":"https://openalex.org/keywords/exact-optimization","display_name":"exact optimization","score":0.5590000152587891}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6126000285148621},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6115999817848206},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6075999736785889},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5845999717712402},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5658000111579895},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5408999919891357},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.5159000158309937},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46630001068115234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45170000195503235},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4383000135421753},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.41280001401901245},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.39070001244544983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35519999265670776},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3544999957084656},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.32280001044273376},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2955000102519989},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.2754000127315521},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.26089999079704285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:d.cobiss.net/repository/si:290903555","doi":null,"is_oa":true,"landing_page_url":"https://github.com/Rudolfovoorg/A-Direct-SDP-Approach-for-QBOs","pdf_url":null,"source":{"id":"https://openalex.org/S7407055177","display_name":"dCOBISS.SI Digital Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:d.cobiss.net/repository/si:290903555","doi":null,"is_oa":true,"landing_page_url":"https://github.com/Rudolfovoorg/A-Direct-SDP-Approach-for-QBOs","pdf_url":null,"source":{"id":"https://openalex.org/S7407055177","display_name":"dCOBISS.SI Digital Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2810228213","https://openalex.org/W2099736282","https://openalex.org/W6893219638","https://openalex.org/W4390305946","https://openalex.org/W4291293244","https://openalex.org/W2315274071","https://openalex.org/W115532318","https://openalex.org/W2562729437","https://openalex.org/W3085548870","https://openalex.org/W2058989416"],"abstract_inverted_index":{"This":[0],"repository":[1,28,99,138],"contains":[2],"the":[3,12,64,77,105,125,144,152,160,175],"source":[4],"code,":[5],"computational":[6,176],"experiments,":[7],"analysis,":[8],"and":[9,58,128,141,155,166,178],"benchmarks":[10],"accompanying":[11,167],"paper":[13],"A":[14],"Direct":[15],"SDP-Based":[16],"Framework":[17],"for":[18,21,36,46,93,124,182,189],"Certified":[19],"Bounds":[20],"Constrained":[22],"Quadratic":[23],"Binary":[24],"Optimization":[25],"Problems.":[26],"The":[27,49,98,133,164],"implements":[29,101],"a":[30,80,180],"direct":[31],"semidefinite":[32],"programming":[33],"(SDP)":[34],"approach":[35],"constrained":[37,112,190],"quadratic":[38,191],"binary":[39,113,192],"optimization,":[40,114],"designed":[41],"to":[42,111,171],"obtain":[43],"strong":[44],"bounds":[45,91],"exact":[47,186],"optimization.":[48,193],"SDP":[50,68,86],"relaxation":[51],"is":[52],"strengthened":[53],"using":[54],"quadratized":[55],"linear":[56],"constraints":[57],"triangle":[59],"(hypermetric)":[60],"inequalities.":[61],"To":[62],"address":[63],"numerical":[65,72],"infeasibility":[66],"of":[67,104,174],"solutions":[69,87],"obtained":[70],"from":[71],"solvers":[73],"such":[74],"as":[75],"MOSEK,":[76],"framework":[78],"includes":[79],"correction":[81],"procedure":[82],"that":[83],"converts":[84],"approximate":[85],"into":[88],"mathematically":[89],"certified":[90],"suitable":[92],"use":[94],"in":[95,136],"Branch-and-Bound":[96],"algorithms.":[97],"also":[100],"an":[102],"adaptation":[103],"Goemans\u2013Williamson":[106],"randomized":[107],"hyperplane":[108],"rounding":[109],"scheme":[110],"together":[115],"with":[116],"problem-specific":[117],"feasibility":[118],"restoration.":[119],"Computational":[120],"experiments":[121],"are":[122,169],"provided":[123],"Sparsest":[126],"k-Subgraph":[127],"Maximum":[129],"Independent":[130],"Set":[131],"problems.":[132],"work":[134],"presented":[135],"this":[137],"was":[139],"funded":[140,150],"developed":[142],"under":[143],"QBIQ":[145],"project":[146],"(project":[147],"no.":[148],"644),":[149],"by":[151],"Slovenian":[153],"Research":[154],"Innovation":[156],"Agency":[157],"(ARIS)":[158],"through":[159],"Applied":[161],"Projects":[162],"programme.":[163],"code":[165],"data":[168],"intended":[170],"facilitate":[172],"reproducibility":[173],"results":[177],"provide":[179],"foundation":[181],"further":[183],"research":[184],"on":[185],"SDP-based":[187],"methods":[188]},"counts_by_year":[],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2026-09-16T00:00:00"}