{"id":"https://openalex.org/W2171325208","doi":"https://doi.org/10.1137/120878495","title":"An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations","display_name":"An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2171325208","doi":"https://doi.org/10.1137/120878495","mag":"2171325208"},"language":"en","primary_location":{"id":"doi:10.1137/120878495","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120878495","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5066641730","display_name":"Christoph Buchheim","orcid":"https://orcid.org/0000-0001-9974-404X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"C. Buchheim","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030935361","display_name":"Marianna De Santis","orcid":"https://orcid.org/0000-0002-1189-5917"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. De Santis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002827275","display_name":"Laura Palagi","orcid":"https://orcid.org/0000-0002-9496-6097"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L. Palagi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000534264","display_name":"Mauro Piacentini","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Piacentini","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5066641730"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.5154,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.97225573,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"3","first_page":"1867","last_page":"1889"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9786999821662903,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9763000011444092,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.8216068744659424},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.740761935710907},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6408213376998901},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.6407971978187561},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6256782412528992},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5971298813819885},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5963521003723145},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5857862234115601},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5681371688842773},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5328023433685303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5027525424957275},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48935121297836304},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.4419620633125305},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4248088002204895},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4144146144390106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18169355392456055},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07472783327102661},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06373319029808044}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.8216068744659424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.740761935710907},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6408213376998901},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.6407971978187561},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6256782412528992},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5971298813819885},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5963521003723145},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5857862234115601},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5681371688842773},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5328023433685303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5027525424957275},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48935121297836304},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.4419620633125305},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4248088002204895},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4144146144390106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18169355392456055},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07472783327102661},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06373319029808044},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/120878495","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120878495","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.721.6325","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.721.6325","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iasi.cnr.it/aussois/web/uploads/2013/papers/buchheimc.pdf","raw_type":"text"},{"id":"pmh:oai:flore.unifi.it:2158/1350095","is_oa":false,"landing_page_url":"https://hdl.handle.net/2158/1350095","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"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":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/485268","is_oa":false,"landing_page_url":"http://epubs.siam.org/doi/abs/10.1137/120878495","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W93853765","https://openalex.org/W147998453","https://openalex.org/W231006424","https://openalex.org/W1507741784","https://openalex.org/W1530146942","https://openalex.org/W1571070457","https://openalex.org/W1572739191","https://openalex.org/W1669104078","https://openalex.org/W1841441531","https://openalex.org/W1979603710","https://openalex.org/W1988622494","https://openalex.org/W1991638696","https://openalex.org/W1994666506","https://openalex.org/W1994722534","https://openalex.org/W1999613943","https://openalex.org/W2000642309","https://openalex.org/W2010401649","https://openalex.org/W2015263936","https://openalex.org/W2030607944","https://openalex.org/W2031494345","https://openalex.org/W2040055413","https://openalex.org/W2051664786","https://openalex.org/W2061657011","https://openalex.org/W2067314231","https://openalex.org/W2075184363","https://openalex.org/W2082874874","https://openalex.org/W2088053023","https://openalex.org/W2089986028","https://openalex.org/W2091850740","https://openalex.org/W2093790790","https://openalex.org/W2134847890","https://openalex.org/W2149454052","https://openalex.org/W2157030448","https://openalex.org/W2169053534","https://openalex.org/W2170213261","https://openalex.org/W2610857016","https://openalex.org/W2798901099","https://openalex.org/W3003775594","https://openalex.org/W4236488031","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2375684291","https://openalex.org/W2354676191","https://openalex.org/W3188646203","https://openalex.org/W136674370","https://openalex.org/W2909957174","https://openalex.org/W2105527480","https://openalex.org/W2052387497","https://openalex.org/W2080108722","https://openalex.org/W4246278799","https://openalex.org/W2050203848"],"abstract_inverted_index":{"We":[0,68],"propose":[1],"a":[2,7,84],"branch-and-bound":[3,85],"algorithm":[4,17,94],"for":[5,104],"minimizing":[6],"not":[8],"necessarily":[9],"convex":[10],"quadratic":[11],"function":[12,30],"over":[13,31],"integer":[14],"variables.":[15],"The":[16],"is":[18,101],"based":[19],"on":[20],"lower":[21],"bounds":[22],"computed":[23,57],"as":[24],"continuous":[25,81],"minima":[26,54],"of":[27,45,50,79,91],"the":[28,35,42,46,51,59,77,80,89,92],"objective":[29],"appropriate":[32],"ellipsoids.":[33],"In":[34,48],"nonconvex":[36],"case,":[37],"we":[38],"use":[39],"ellipsoids":[40],"enclosing":[41],"feasible":[43],"region":[44],"problem.":[47],"spite":[49],"nonconvexity,":[52],"these":[53],"can":[55],"be":[56],"quickly;":[58],"corresponding":[60],"optimization":[61],"problems":[62],"are":[63],"equivalent":[64],"to":[65,75],"trust-region":[66],"subproblems.":[67],"present":[69],"several":[70],"ideas":[71],"that":[72],"allow":[73],"us":[74],"accelerate":[76],"solution":[78],"relaxation":[82],"within":[83],"scheme":[86],"and":[87],"examine":[88],"performance":[90,100],"overall":[93],"by":[95],"computational":[96,99],"experiments.":[97],"Good":[98],"shown":[102],"especially":[103],"ternary":[105],"instances.":[106]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}