{"id":"https://openalex.org/W7119509167","doi":"https://doi.org/10.1007/s10898-025-01586-2","title":"Quadratic convex reformulations for multiObjective binary quadratic programming","display_name":"Quadratic convex reformulations for multiObjective binary quadratic programming","publication_year":2026,"publication_date":"2026-01-09","ids":{"openalex":"https://openalex.org/W7119509167","doi":"https://doi.org/10.1007/s10898-025-01586-2"},"language":"en","primary_location":{"id":"doi:10.1007/s10898-025-01586-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10898-025-01586-2","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030935361","display_name":"Marianna De Santis","orcid":"https://orcid.org/0000-0002-1189-5917"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marianna De Santis","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 degli Studi di Firenze, Via di Santa Marta 3, 50139, Firenze, Italia"],"raw_orcid":"https://orcid.org/0000-0002-1189-5917","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 degli Studi di Firenze, Via di Santa Marta 3, 50139, Firenze, Italia","institution_ids":["https://openalex.org/I45084792"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122348247","display_name":"Lucas L\u00e9tocart","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lucas L\u00e9tocart","raw_affiliation_strings":["Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Paris Nord, Universit\u00e9 Sorbonne Paris Nord, 99 Av. Jean Baptiste Cl\u00e9ment, 93430, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Paris Nord, Universit\u00e9 Sorbonne Paris Nord, 99 Av. Jean Baptiste Cl\u00e9ment, 93430, Villetaneuse, France","institution_ids":["https://openalex.org/I39804081","https://openalex.org/I4210091279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5122336934","display_name":"Yue Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yue Zhang","raw_affiliation_strings":["Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Paris Nord, Universit\u00e9 Sorbonne Paris Nord, 99 Av. Jean Baptiste Cl\u00e9ment, 93430, Villetaneuse, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique de l\u2019Universit\u00e9 Paris Nord, Universit\u00e9 Sorbonne Paris Nord, 99 Av. Jean Baptiste Cl\u00e9ment, 93430, Villetaneuse, France","institution_ids":["https://openalex.org/I39804081","https://openalex.org/I4210091279"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030935361"],"corresponding_institution_ids":["https://openalex.org/I45084792"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0739995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"94","issue":"3","first_page":"667","last_page":"698"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.3481999933719635,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.3481999933719635,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.31040000915527344,"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.24310000240802765,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.7914000153541565},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7371000051498413},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.6708999872207642},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6396999955177307},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6047999858856201},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.5670999884605408},{"id":"https://openalex.org/keywords/binary-quadratic-form","display_name":"Binary quadratic form","score":0.5641000270843506},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.504800021648407},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44830000400543213},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.44609999656677246}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8492000102996826},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.7914000153541565},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7371000051498413},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.6708999872207642},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6396999955177307},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6047999858856201},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.5670999884605408},{"id":"https://openalex.org/C80695182","wikidata":"https://www.wikidata.org/wiki/Q864134","display_name":"Binary quadratic form","level":4,"score":0.5641000270843506},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5594000220298767},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.504800021648407},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44830000400543213},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44609999656677246},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.4072999954223633},{"id":"https://openalex.org/C21440807","wikidata":"https://www.wikidata.org/wiki/Q4968811","display_name":"Isotropic quadratic form","level":5,"score":0.40220001339912415},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.3953000009059906},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.38179999589920044},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.367900013923645},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3303999900817871},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.323199987411499},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.29980000853538513},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2897999882698059},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.28220000863075256},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2655999958515167},{"id":"https://openalex.org/C2983524802","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic model","level":3,"score":0.26460000872612},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2597000002861023},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.258899986743927},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10898-025-01586-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10898-025-01586-2","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},{"id":"pmh:oai:flore.unifi.it:2158/1450455","is_oa":false,"landing_page_url":"https://hdl.handle.net/2158/1450455","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320330232","display_name":"Sorbonne Universit\u00e9","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1968876856","https://openalex.org/W2003648292","https://openalex.org/W2004030424","https://openalex.org/W2026662237","https://openalex.org/W2031978868","https://openalex.org/W2050336256","https://openalex.org/W2087591761","https://openalex.org/W2142097077","https://openalex.org/W2146361854","https://openalex.org/W2279359816","https://openalex.org/W2582889117","https://openalex.org/W2783814264","https://openalex.org/W2800822983","https://openalex.org/W2889871839","https://openalex.org/W2946074638","https://openalex.org/W2966382902","https://openalex.org/W2983523747","https://openalex.org/W3111407032","https://openalex.org/W3124460525","https://openalex.org/W3134176015","https://openalex.org/W3165944435","https://openalex.org/W3216881728","https://openalex.org/W4205253277","https://openalex.org/W4220712670","https://openalex.org/W4293879931","https://openalex.org/W4319225049","https://openalex.org/W4321769344","https://openalex.org/W4383227385","https://openalex.org/W4385491520","https://openalex.org/W4386380125","https://openalex.org/W4403311361","https://openalex.org/W4404092308","https://openalex.org/W7117307132"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-10T06:02:16.177343","created_date":"2026-01-09T00:00:00"}