{"id":"https://openalex.org/W4229374814","doi":"https://doi.org/10.1007/s10898-022-01157-9","title":"Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints","display_name":"Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints","publication_year":2022,"publication_date":"2022-05-09","ids":{"openalex":"https://openalex.org/W4229374814","doi":"https://doi.org/10.1007/s10898-022-01157-9"},"language":"en","primary_location":{"id":"doi:10.1007/s10898-022-01157-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-022-01157-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-022-01157-9.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10898-022-01157-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102921808","display_name":"Sven de Vries","orcid":"https://orcid.org/0000-0002-2440-4937"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sven de Vries","raw_affiliation_strings":["Operations Research, FB IV - Mathematics, Trier University, 54286, Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research, FB IV - Mathematics, Trier University, 54286, Trier, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030552696","display_name":"Bernd Perscheid","orcid":"https://orcid.org/0000-0002-9756-6603"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bernd Perscheid","raw_affiliation_strings":["Operations Research, FB IV - Mathematics, Trier University, 54286, Trier, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9756-6603","affiliations":[{"raw_affiliation_string":"Operations Research, FB IV - Mathematics, Trier University, 54286, Trier, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030552696"],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2780},"fwci":0.1522,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47910132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"84","issue":"3","first_page":"591","last_page":"606"},"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.9983999729156494,"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.9983999729156494,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9901000261306763,"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/quadric","display_name":"Quadric","score":0.8842219114303589},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8564540147781372},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8182682991027832},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6401032209396362},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.634124755859375},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6157687902450562},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6102951765060425},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6060329079627991},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47461026906967163},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.44536393880844116},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4400344789028168},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.4134982228279114},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3276170492172241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2857280373573303},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2690293788909912},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.23808056116104126},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1719038486480713}],"concepts":[{"id":"https://openalex.org/C2779219049","wikidata":"https://www.wikidata.org/wiki/Q852117","display_name":"Quadric","level":2,"score":0.8842219114303589},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8564540147781372},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8182682991027832},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6401032209396362},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.634124755859375},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6157687902450562},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6102951765060425},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6060329079627991},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47461026906967163},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.44536393880844116},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4400344789028168},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.4134982228279114},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3276170492172241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2857280373573303},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2690293788909912},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.23808056116104126},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1719038486480713},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10898-022-01157-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-022-01157-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-022-01157-9.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jglopt:v:84:y:2022:i:3:d:10.1007_s10898-022-01157-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10898-022-01157-9","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:econstor.eu:10419/307497","is_oa":true,"landing_page_url":"https://hdl.handle.net/10419/307497","pdf_url":null,"source":{"id":"https://openalex.org/S4306401696","display_name":"Econstor (Econstor)","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doc-type:article"}],"best_oa_location":{"id":"doi:10.1007/s10898-022-01157-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-022-01157-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-022-01157-9.pdf","source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320318419","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4229374814.pdf","grobid_xml":"https://content.openalex.org/works/W4229374814.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1988622494","https://openalex.org/W2000642309","https://openalex.org/W2012605254","https://openalex.org/W2025308368","https://openalex.org/W2035660776","https://openalex.org/W2109933087","https://openalex.org/W2169053534","https://openalex.org/W2412657279","https://openalex.org/W2790253958"],"related_works":["https://openalex.org/W2609891207","https://openalex.org/W1497213067","https://openalex.org/W2073944685","https://openalex.org/W2161798622","https://openalex.org/W2030257792","https://openalex.org/W2127777220","https://openalex.org/W2089953380","https://openalex.org/W4255492803","https://openalex.org/W1984804966","https://openalex.org/W2588840994"],"abstract_inverted_index":{"Abstract":[0],"Cutting":[1],"planes":[2],"from":[3,136,147],"the":[4,13,17,39,43,69,83,105,120],"Boolean":[5,44],"Quadric":[6,45],"Polytope":[7,46],"can":[8,114],"be":[9],"used":[10],"to":[11,66,75],"reduce":[12],"optimality":[14],"gap":[15],"of":[16,38,42,58,107],"$$\\mathcal":[18],"{NP}$$":[19],"<mml:math":[20],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[21],"<mml:mi>NP</mml:mi>":[22],"</mml:math>":[23],"-hard":[24],"nonconvex":[25],"quadratic":[26],"program":[27],"with":[28,123],"box":[29],"constraints":[30],"(BoxQP).":[31],"It":[32],"is":[33],"known":[34],"that":[35,112],"all":[36,59],"cuts":[37],"Chv\u00e1tal\u2013Gomory":[40,70],"closure":[41,71],"are":[47,131],"A":[48,60,149],"-odd":[49,61,150],"cycle":[50,62,151],"inequalities.":[51],"We":[52],"obtain":[53],"a":[54,100,124],"compact":[55],"extended":[56],"relaxation":[57,109],"inequalities,":[63],"which":[64,145],"allows":[65],"optimize":[67],"over":[68],"without":[72],"repeated":[73],"calls":[74],"separation":[76],"algorithms":[77],"and":[78,110],"has":[79],"less":[80],"inequalities":[81,152],"than":[82,134],"formulation":[84],"provided":[85],"by":[86],"Boros":[87],"et":[88,138],"al.":[89,139],"(SIAM":[90],"J":[91],"Discrete":[92],"Math":[93],"5(2):163\u2013177,":[94],"1992)":[95],"for":[96,119],"sparse":[97],"matrices.":[98],"In":[99],"computational":[101],"study,":[102],"we":[103,113],"confirm":[104],"strength":[106],"this":[108],"show":[111],"provide":[115],"very":[116],"strong":[117],"bounds":[118,130],"BoxQP,":[121],"even":[122],"plain":[125],"linear":[126],"program.":[127],"The":[128],"resulting":[129],"significantly":[132],"stronger":[133],"these":[135],"Bonami":[137],"(Math":[140],"Program":[141],"Comput":[142],"10(3):333\u2013382,":[143],"2018),":[144],"arise":[146],"separating":[148],"heuristically.":[153]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}