{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:04:09Z","timestamp":1784894649733,"version":"3.55.0"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T00:00:00Z","timestamp":1781136000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001655","name":"Deutscher Akademischer Austauschdienst","doi-asserted-by":"publisher","award":["57711909"],"award-info":[{"award-number":["57711909"]}],"id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100021828","name":"DAAD Regional Office New York","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100021828","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDP\/00326\/2025"],"award-info":[{"award-number":["UIDP\/00326\/2025"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/00326\/2025"],"award-info":[{"award-number":["UIDB\/00326\/2025"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["CA22137"],"award-info":[{"award-number":["CA22137"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107578","type":"journal-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:06:10Z","timestamp":1781222770000},"page":"107578","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Solving hypervolume scalarizations for MOCO problems"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4192-689X","authenticated-orcid":false,"given":"Gon\u00e7alo","family":"Lopes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9119-0732","authenticated-orcid":false,"given":"Kathrin","family":"Klamroth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7525-8901","authenticated-orcid":false,"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2026.107578_b1","doi-asserted-by":"crossref","first-page":"2311","DOI":"10.1093\/imanum\/draa038","article-title":"Accurately computing the log-sum-exp and softmax functions","volume":"41","author":"Blanchard","year":"2020","journal-title":"IMA J. Numer. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0272-4979","issn-type":"print"},{"issue":"2","key":"10.1016\/j.cor.2026.107578_b2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete-variable extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0030-364X","issn-type":"print"},{"key":"10.1016\/j.cor.2026.107578_b3","series-title":"Multicriteria Optimization","isbn-type":"print","author":"Ehrgott","year":"2005","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540213987"},{"issue":"6","key":"10.1016\/j.cor.2026.107578_b4","doi-asserted-by":"crossref","DOI":"10.1145\/3453474","article-title":"The hypervolume indicator: Computational problems and algorithms","volume":"54","author":"Guerreiro","year":"2021","journal-title":"ACM Comput. Surv.","ISSN":"https:\/\/id.crossref.org\/issn\/0360-0300","issn-type":"print"},{"key":"10.1016\/j.cor.2026.107578_b5","series-title":"Gurobi optimizer reference manual","author":"Gurobi Optimization, LLC","year":"2024"},{"key":"10.1016\/j.cor.2026.107578_b6","series-title":"Greedy-hps-moco: v1.0.0","author":"Lopes","year":"2025"},{"key":"10.1016\/j.cor.2026.107578_b7","series-title":"Mobkp-instances: v1.0.0","author":"Lopes","year":"2025"},{"key":"10.1016\/j.cor.2026.107578_b8","series-title":"HS-MOKP: Hypervolume scalarization formulations for the multiobjective knapsack problem","author":"Lopes","year":"2026"},{"key":"10.1016\/j.cor.2026.107578_b9","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107140","article-title":"A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization","volume":"183","author":"Lopes","year":"2025","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107578_b10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","article-title":"Computability of global solutions to factorable nonconvex programs: Part I \u2013 Convex underestimating problems","volume":"10","author":"Mccormick","year":"1976","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"key":"10.1016\/j.cor.2026.107578_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105349","article-title":"Computing representations using hypervolume scalarizations","volume":"137","author":"Paquete","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107578_b12","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1007\/s11081-020-09586-9","article-title":"Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components","volume":"22","author":"Schultes","year":"2021","journal-title":"Optim. Eng."},{"issue":"1","key":"10.1016\/j.cor.2026.107578_b13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00186-020-00702-0","article-title":"On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem","volume":"92","author":"Schulze","year":"2020","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107578_b14","doi-asserted-by":"crossref","first-page":"2186","DOI":"10.1109\/TCYB.2018.2885974","article-title":"The set-based hypervolume Newton method for bi-objective optimization","volume":"50","author":"Sosa-Hern\u00e1ndez","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.cor.2026.107578_b15","series-title":"Enumerative Combinatorics, Volume 1","isbn-type":"print","volume":"vol. 49","author":"Stanley","year":"2012","ISBN":"https:\/\/id.crossref.org\/isbn\/9781107015425"},{"key":"10.1016\/j.cor.2026.107578_b16","series-title":"Parallel Problem Solving from Nature \u2014 PPSN V","isbn-type":"print","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0056872","article-title":"Multiobjective optimization using evolutionary algorithms \u2014 A comparative case study","author":"Zitzler","year":"1998","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540496724"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001966?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001966?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T11:38:01Z","timestamp":1784893081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":16,"alternative-id":["S0305054826001966"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107578","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving hypervolume scalarizations for MOCO problems","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107578","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107578"}}