{"id":"https://openalex.org/W2920857515","doi":"https://doi.org/10.1007/s13675-019-00110-y","title":"Improving the linear relaxation of maximum k-cut with semidefinite-based constraints","display_name":"Improving the linear relaxation of maximum k-cut with semidefinite-based constraints","publication_year":2019,"publication_date":"2019-03-16","ids":{"openalex":"https://openalex.org/W2920857515","doi":"https://doi.org/10.1007/s13675-019-00110-y","mag":"2920857515"},"language":"en","primary_location":{"id":"doi:10.1007/s13675-019-00110-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-019-00110-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-019-00110-y","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110602252","display_name":"VilmarJeft\u00e9 Rodrigues de Sousa","orcid":null},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"VilmarJeft\u00e9 Rodrigues de Sousa","raw_affiliation_strings":["GERAD and D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, \u00c9cole Polytechnique de Montr\u00e9al, C.P. 6079, Succ. Centre-ville, H3C 3A7, Montreal, QC, Canada"],"affiliations":[{"raw_affiliation_string":"GERAD and D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, \u00c9cole Polytechnique de Montr\u00e9al, C.P. 6079, Succ. Centre-ville, H3C 3A7, Montreal, QC, Canada","institution_ids":["https://openalex.org/I45683168"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005540131","display_name":"Miguel F. Anjos","orcid":"https://orcid.org/0000-0002-8258-9116"},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"MiguelF. Anjos","raw_affiliation_strings":["GERAD and D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, \u00c9cole Polytechnique de Montr\u00e9al, C.P. 6079, Succ. Centre-ville, H3C 3A7, Montreal, QC, Canada"],"affiliations":[{"raw_affiliation_string":"GERAD and D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, \u00c9cole Polytechnique de Montr\u00e9al, C.P. 6079, Succ. Centre-ville, H3C 3A7, Montreal, QC, Canada","institution_ids":["https://openalex.org/I45683168"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022173011","display_name":"S\u00e9bastien Le Digabel","orcid":"https://orcid.org/0000-0003-3148-5090"},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"S\u00e9bastien Le\u00a0Digabel","raw_affiliation_strings":["GERAD and D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, \u00c9cole Polytechnique de Montr\u00e9al, C.P. 6079, Succ. Centre-ville, H3C 3A7, Montreal, QC, Canada"],"affiliations":[{"raw_affiliation_string":"GERAD and D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, \u00c9cole Polytechnique de Montr\u00e9al, C.P. 6079, Succ. Centre-ville, H3C 3A7, Montreal, QC, Canada","institution_ids":["https://openalex.org/I45683168"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022173011"],"corresponding_institution_ids":["https://openalex.org/I45683168"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":1.397,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.83032692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"2","first_page":"123","last_page":"151"},"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.9987000226974487,"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.9987000226974487,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9966999888420105,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.9033005237579346},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.8019649982452393},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6705077886581421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6642974615097046},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6536405086517334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6408933401107788},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6197423338890076},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5818649530410767},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.5260539054870605},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5029842257499695},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.494434118270874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4642854928970337},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45019981265068054},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.44290825724601746},{"id":"https://openalex.org/keywords/facet","display_name":"Facet (psychology)","score":0.43427595496177673},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4050768315792084},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.3401927351951599},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.241756409406662},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.10692986845970154}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.9033005237579346},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.8019649982452393},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6705077886581421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6642974615097046},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6536405086517334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6408933401107788},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6197423338890076},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5818649530410767},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.5260539054870605},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5029842257499695},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.494434118270874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4642854928970337},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45019981265068054},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.44290825724601746},{"id":"https://openalex.org/C43122875","wikidata":"https://www.wikidata.org/wiki/Q5428522","display_name":"Facet (psychology)","level":4,"score":0.43427595496177673},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4050768315792084},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3401927351951599},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.241756409406662},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.10692986845970154},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2865642","wikidata":"https://www.wikidata.org/wiki/Q378132","display_name":"Big Five personality traits","level":3,"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C187288502","wikidata":"https://www.wikidata.org/wiki/Q641118","display_name":"Personality","level":2,"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":6,"locations":[{"id":"doi:10.1007/s13675-019-00110-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-019-00110-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/2e8ed795-0174-4bb1-bc2d-7ad70b4af78d","is_oa":true,"landing_page_url":null,"pdf_url":"https://www.research.ed.ac.uk/en/publications/2e8ed795-0174-4bb1-bc2d-7ad70b4af78d","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:publications/2e8ed795-0174-4bb1-bc2d-7ad70b4af78d","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/2e8ed795-0174-4bb1-bc2d-7ad70b4af78d","pdf_url":"https://www.research.ed.ac.uk/en/publications/2e8ed795-0174-4bb1-bc2d-7ad70b4af78d","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"Rodrigues de Sousa, V J, Anjos, M & Le Digabel, S 2019, 'Improving the linear relaxation of maximum k-cut with semidefinite-based constraints', EURO Journal on Computational Optimization, vol. 7, no. 2, pp. 123-151. https://doi.org/10.1007/s13675-019-00110-y","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:RePEc:spr:eurjco:v:7:y:2019:i:2:d:10.1007_s13675-019-00110-y","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s13675-019-00110-y","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:e83f83c8eb1e402f83fc6eed4310cd7b","is_oa":true,"landing_page_url":"https://doaj.org/article/e83f83c8eb1e402f83fc6eed4310cd7b","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, Vol 7, Iss 2, Pp 123-151 (2019)","raw_type":"article"},{"id":"pmh:oai:publications.polymtl.ca:43593","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/43593/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":{"id":"doi:10.1007/s13675-019-00110-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-019-00110-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1335262477","display_name":null,"funder_award_id":"312125","funder_id":"https://openalex.org/F4320321487","funder_display_name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G76262708","display_name":null,"funder_award_id":"418250","funder_id":"https://openalex.org/F4320321487","funder_display_name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320321487","display_name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W68231821","https://openalex.org/W152441072","https://openalex.org/W161953739","https://openalex.org/W1553621070","https://openalex.org/W1564910180","https://openalex.org/W1574951568","https://openalex.org/W1581428370","https://openalex.org/W1601503375","https://openalex.org/W1602308653","https://openalex.org/W1981917097","https://openalex.org/W1985123706","https://openalex.org/W1986613675","https://openalex.org/W1989947834","https://openalex.org/W1993052292","https://openalex.org/W1994932713","https://openalex.org/W2002055996","https://openalex.org/W2010334716","https://openalex.org/W2033498477","https://openalex.org/W2038225707","https://openalex.org/W2043471141","https://openalex.org/W2047609571","https://openalex.org/W2057830724","https://openalex.org/W2063117516","https://openalex.org/W2065967558","https://openalex.org/W2068531154","https://openalex.org/W2069154666","https://openalex.org/W2069816168","https://openalex.org/W2075887074","https://openalex.org/W2078979423","https://openalex.org/W2084788931","https://openalex.org/W2125240990","https://openalex.org/W2130312263","https://openalex.org/W2148606255","https://openalex.org/W2149454052","https://openalex.org/W2150305542","https://openalex.org/W2152686051","https://openalex.org/W2159739530","https://openalex.org/W2227764400","https://openalex.org/W2242324393","https://openalex.org/W2395781967","https://openalex.org/W2404422255","https://openalex.org/W2560347594","https://openalex.org/W2617844366","https://openalex.org/W2751855500","https://openalex.org/W4205295219","https://openalex.org/W6600310816","https://openalex.org/W6667450679","https://openalex.org/W6682697821"],"related_works":["https://openalex.org/W2362705850","https://openalex.org/W2513180016","https://openalex.org/W2366269287","https://openalex.org/W2085647652","https://openalex.org/W3000089047","https://openalex.org/W2390699817","https://openalex.org/W2920857515","https://openalex.org/W1512175223","https://openalex.org/W4287552035","https://openalex.org/W1564910180"],"abstract_inverted_index":{"We":[0,54],"consider":[1],"the":[2,9,20,23,26,62,73,107,112,118],"maximum":[3],"k-cut":[4],"problem":[5],"that":[6,19,59,106],"involves":[7],"partitioning":[8],"vertex":[10],"set":[11],"of":[12,22,25,65,75,85,114],"a":[13,50,56],"graph":[14],"into":[15],"k":[16,86],"subsets":[17,32],"such":[18],"sum":[21],"weights":[24],"edges":[27,125],"joining":[28],"vertices":[29],"in":[30],"different":[31],"is":[33,41,93],"maximized.":[34],"The":[35,90],"associated":[36],"semidefinite":[37],"programming":[38,79],"(SDP)":[39],"relaxation":[40,92],"known":[42],"to":[43],"provide":[44],"strong":[45],"bounds,":[46],"but":[47],"it":[48],"has":[49],"high":[51],"computational":[52,103],"cost.":[53],"use":[55],"cutting-plane":[57],"algorithm":[58],"relies":[60],"on":[61],"early":[63],"termination":[64],"an":[66],"interior":[67],"point":[68],"method,":[69],"and":[70,77,87,99,126],"we":[71],"study":[72],"performance":[74],"SDP":[76,119],"linear":[78],"(LP)":[80],"relaxations":[81,120],"for":[82,121],"various":[83],"values":[84],"instance":[88],"types.":[89],"LP":[91,108],"strengthened":[94],"using":[95],"combinatorial":[96],"facet-defining":[97],"inequalities":[98],"SDP-based":[100,115],"constraints.":[101],"Our":[102],"results":[104],"suggest":[105],"approach,":[109],"especially":[110],"with":[111,123],"addition":[113],"constraints,":[116],"outperforms":[117],"graphs":[122],"positive-weight":[124],"k\u22657.":[127]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}