{"id":"https://openalex.org/W2952070826","doi":"https://doi.org/10.48550/arxiv.cs/0407041","title":"Exploiting Semidefinite Relaxations in Constraint Programming","display_name":"Exploiting Semidefinite Relaxations in Constraint Programming","publication_year":2004,"publication_date":"2004-07-16","ids":{"openalex":"https://openalex.org/W2952070826","doi":"https://doi.org/10.48550/arxiv.cs/0407041","mag":"2952070826"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:cs/0407041","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0407041","pdf_url":"https://arxiv.org/pdf/cs/0407041","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0407041","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110200956","display_name":"Willem Jan van Hoeve","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"van Hoeve, Willem Jan","raw_affiliation_strings":["CWI, GB Amsterdam, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"CWI, GB Amsterdam, The Netherlands#TAB#","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110200956"],"corresponding_institution_ids":["https://openalex.org/I1341640284"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7893954515457153},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6642268896102905},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.6273937821388245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5954923033714294},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5733194351196289},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5714868307113647},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5065933465957642},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.504419207572937},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48192763328552246},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.44745510816574097},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4329163432121277},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4325382709503174},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4313731789588928},{"id":"https://openalex.org/keywords/large-margin-nearest-neighbor","display_name":"Large margin nearest neighbor","score":0.42014020681381226},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.41814225912094116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3753613829612732},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.35081225633621216},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2746923267841339},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21244513988494873},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.13079428672790527},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.12594115734100342},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08918160200119019}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7893954515457153},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6642268896102905},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.6273937821388245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5954923033714294},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5733194351196289},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5714868307113647},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5065933465957642},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.504419207572937},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48192763328552246},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.44745510816574097},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4329163432121277},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4325382709503174},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4313731789588928},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.42014020681381226},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.41814225912094116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3753613829612732},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35081225633621216},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2746923267841339},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21244513988494873},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.13079428672790527},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.12594115734100342},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08918160200119019},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:cs/0407041","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0407041","pdf_url":"https://arxiv.org/pdf/cs/0407041","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.cs/0407041","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.cs/0407041","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0407041","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0407041","pdf_url":"https://arxiv.org/pdf/cs/0407041","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2364528045","https://openalex.org/W2348903644","https://openalex.org/W1653317167","https://openalex.org/W2737505353","https://openalex.org/W2385886188","https://openalex.org/W2370797736","https://openalex.org/W2366269287","https://openalex.org/W3154036230","https://openalex.org/W2369616053","https://openalex.org/W2544939111"],"abstract_inverted_index":{"Constraint":[0],"programming":[1,89],"uses":[2],"enumeration":[3],"and":[4,81],"search":[5,47,53,74],"tree":[6],"pruning":[7],"to":[8,15,41,69],"solve":[9],"combinatorial":[10],"optimization":[11],"problems.":[12],"In":[13,31],"order":[14],"speed":[16],"up":[17],"this":[18],"solution":[19,36,64],"process,":[20],"we":[21,33],"investigate":[22],"the":[23,35,43,46,63,73],"use":[24,34],"of":[25,37,45,72],"semidefinite":[26,39,57,95],"relaxations":[27],"within":[28],"constraint":[29,88],"programming.":[30],"principle,":[32],"a":[38,50,56,60],"relaxation":[40,58],"guide":[42],"traversal":[44],"tree,":[48],"using":[49],"limited":[51],"discrepancy":[52],"strategy.":[54],"Furthermore,":[55],"produces":[59],"bound":[61],"for":[62],"value,":[65],"which":[66],"is":[67],"used":[68],"prune":[70],"parts":[71],"tree.":[75],"Experimental":[76],"results":[77],"on":[78],"stable":[79],"set":[80],"maximum":[82],"clique":[83],"problem":[84],"instances":[85],"show":[86],"that":[87],"can":[90],"indeed":[91],"greatly":[92],"benefit":[93],"from":[94],"relaxations.":[96]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}