{"id":"https://openalex.org/W2939980816","doi":"https://doi.org/10.1137/16m107428x","title":"Solving Quadratic Programming by Cutting Planes","display_name":"Solving Quadratic Programming by Cutting Planes","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2939980816","doi":"https://doi.org/10.1137/16m107428x","mag":"2939980816"},"language":"en","primary_location":{"id":"doi:10.1137/16m107428x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m107428x","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/A5048185520","display_name":"Pierre Bonami","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pierre Bonami","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083656325","display_name":"Andrea Lodi","orcid":"https://orcid.org/0000-0001-9269-633X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrea Lodi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070387280","display_name":"Jonas Schweiger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonas Schweiger","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025486949","display_name":"Andrea Tramontani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrea Tramontani","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048185520"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5706,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.9299422,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"29","issue":"2","first_page":"1076","last_page":"1105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9986000061035156,"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.9986000061035156,"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.9926000237464905,"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/T12288","display_name":"Optimization and Search Problems","score":0.9918000102043152,"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/mathematics","display_name":"Mathematics","score":0.825133204460144},{"id":"https://openalex.org/keywords/linearization","display_name":"Linearization","score":0.6469175815582275},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5534458756446838},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5351850390434265},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4866374433040619},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.48620766401290894},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.47690701484680176},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4404800832271576},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4357908368110657},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4226556718349457},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.42208051681518555},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.33057671785354614},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3075501322746277},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.14573261141777039}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.825133204460144},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.6469175815582275},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5534458756446838},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5351850390434265},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4866374433040619},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.48620766401290894},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.47690701484680176},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4404800832271576},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4357908368110657},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4226556718349457},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.42208051681518555},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.33057671785354614},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3075501322746277},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.14573261141777039},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/16m107428x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m107428x","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:cris.unibo.it:11585/815420","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/815420","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"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"},{"id":"pmh:oai:publications.polymtl.ca:43545","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/43545/","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":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G1010037840","display_name":null,"funder_award_id":"PRIN 2012","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"}],"funders":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1481481825","https://openalex.org/W1549791526","https://openalex.org/W1971027118","https://openalex.org/W1988622494","https://openalex.org/W2000923338","https://openalex.org/W2012886081","https://openalex.org/W2022026988","https://openalex.org/W2025308368","https://openalex.org/W2026964350","https://openalex.org/W2027470314","https://openalex.org/W2049143039","https://openalex.org/W2078600458","https://openalex.org/W2081929325","https://openalex.org/W2099168123","https://openalex.org/W2132130706","https://openalex.org/W2133304166","https://openalex.org/W2137023518","https://openalex.org/W2149454052","https://openalex.org/W2162467101","https://openalex.org/W2169053534","https://openalex.org/W2319807324","https://openalex.org/W2790253958"],"related_works":["https://openalex.org/W2402188535","https://openalex.org/W3162501176","https://openalex.org/W3104290058","https://openalex.org/W119756842","https://openalex.org/W2015131155","https://openalex.org/W2083014164","https://openalex.org/W2158503982","https://openalex.org/W2354201224","https://openalex.org/W2091662678","https://openalex.org/W4303982878"],"abstract_inverted_index":{"We":[0,112,124,177,201],"propose":[1,188],"new":[2,151],"cutting":[3,170,185],"planes":[4,171,186],"for":[5,89,221,231],"strengthening":[6],"the":[7,13,35,46,66,77,90,94,100,126,132,137,141,174,183,190,197,228,233],"linear":[8,20,175,242],"relaxations":[9],"that":[10,73,105,116,156,203],"appear":[11],"in":[12,45,72],"solution":[14],"of":[15,26,38,48,68,80,93,140,153,160,169],"nonconvex":[16,238],"quadratic":[17,97,239,245],"problems":[18,31,240],"with":[19,241],"constraints.":[21],"By":[22,144],"a":[23,39,49,110,150,166,210],"famous":[24],"result":[25,67],"Motzkin":[27,69],"and":[28,70,131,162,193,217],"Straus,":[29,71],"these":[30,129],"are":[32,43,56],"connected":[33],"to":[34,58,109,118,165,172,208,236],"clique":[36,78],"number":[37,79],"graph.":[40],"Our":[41],"cuts":[42,88,115,130,205,216,235],"derived":[44],"context":[47],"spatial":[50,191],"branch-and-bound":[51],"algorithm":[52],"where":[53,99],"linearization":[54],"variables":[55,106],"introduced":[57],"represent":[59],"products.":[60],"Their":[61],"validity":[62],"is":[63],"based":[64],"on":[65,76],"it":[74],"depends":[75],"certain":[81],"graphs.":[82,123],"For":[83],"convenience,":[84],"we":[85,148,187,225],"derive":[86,149],"our":[87,204],"special":[91],"case":[92],"so-called":[95],"standard":[96],"programs,":[98],"only":[101],"(linear)":[102],"constraint":[103],"imposes":[104],"must":[107],"belong":[108],"simplex.":[111],"specifically":[113],"consider":[114],"correspond":[117],"carefully":[119],"constructed":[120],"complete":[121],"bipartite":[122],"study":[125],"relation":[127],"between":[128],"classical":[133],"ones":[134],"obtained":[135],"at":[136],"first":[138],"level":[139],"reformulation-linearization":[142,215],"technique.":[143],"studying":[145],"this":[146],"relation,":[147],"type":[152],"valid":[154],"inequalities":[155],"generalizes":[157],"both":[158],"types":[159],"cuts,":[161],"thus":[163],"leading":[164],"large":[167],"family":[168],"strengthen":[173],"relaxation.":[176],"present":[178],"extensive":[179],"computational":[180],"results":[181],"using":[182,232],"different":[184],"within":[189],"branch":[192],"bound":[194,213],"implemented":[195],"by":[196],"commercial":[198],"solver":[199],"CPLEX.":[200],"show":[202],"allow":[206],"us":[207],"obtain":[209],"significantly":[211],"better":[212],"than":[214],"reduce":[218],"computing":[219],"times":[220],"global":[222],"optimality.":[223],"Finally,":[224],"formally":[226],"establish":[227],"scaling":[229],"necessary":[230],"proposed":[234],"solve":[237],"constraints,":[243],"e.g.,":[244],"knapsack":[246],"problems.":[247]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-04-25T00:00:00"}