{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:03:44Z","timestamp":1784894624230,"version":"3.55.0"},"reference-count":45,"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,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"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.107575","type":"journal-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T15:38:40Z","timestamp":1781278720000},"page":"107575","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Optimizing a linear function over the Lorenz-efficient set of multi-objective combinatorial optimization problems"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2958-6603","authenticated-orcid":false,"given":"Mohammed Bachir","family":"Bederina","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Djamal","family":"Chaabane","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8433-518X","authenticated-orcid":false,"given":"Thibaut","family":"Lust","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cor.2026.107575_b1","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1016\/j.ejor.2005.02.072","article-title":"Optimizing a linear function over an integer efficient set","volume":"174","author":"Abbas","year":"2006","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107575_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2023.103965","article-title":"Fair division of indivisible goods: Recent progress and open questions","volume":"322","author":"Amanatidis","year":"2023","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/j.cor.2026.107575_b3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0531(70)90039-6","article-title":"On the measurement of inequality","volume":"2","author":"Atkinson","year":"1970","journal-title":"J. Econom. Theory"},{"key":"10.1016\/j.cor.2026.107575_b4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.camwa.2006.08.014","article-title":"Advancing equitability in multiobjective programming","volume":"52","author":"Baatar","year":"2006","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.cor.2026.107575_b5","series-title":"ECAI 2024","first-page":"4076","article-title":"Generating fair solutions of minimal cost","volume":"vol. 392","author":"Bederina","year":"2024"},{"key":"10.1016\/j.cor.2026.107575_b6","series-title":"ECAI 2020","first-page":"419","article-title":"Regret-based elicitation for solving multi-objective knapsack problems with rank-dependent aggregators","author":"Benabbou","year":"2020"},{"issue":"12","key":"10.1016\/j.cor.2026.107575_b7","doi-asserted-by":"crossref","first-page":"2234","DOI":"10.1287\/mnsc.1120.1549","article-title":"On the efficiency-fairness trade-off","volume":"58","author":"Bertsimas","year":"2012","journal-title":"Manag. Sci."},{"issue":"3","key":"10.1016\/j.cor.2026.107575_b8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1120680.1120683","article-title":"Allocating indivisible goods","volume":"5","author":"Bez\u00e1kov\u00e1","year":"2005","journal-title":"ACM SIGecom Exch."},{"issue":"3","key":"10.1016\/j.cor.2026.107575_b9","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1016\/j.ejor.2016.02.037","article-title":"A new method for optimizing a linear function over the efficient set of a multiobjective integer program","volume":"260","author":"Boland","year":"2017","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107575_b10","series-title":"The Thirty-Third AAAI Conference on Artificial Intelligence","first-page":"7741","article-title":"Active preference learning based on generalized gini functions: Application to the multiagent knapsack problem","author":"Bourdache","year":"2019"},{"issue":"3","key":"10.1016\/j.cor.2026.107575_b11","doi-asserted-by":"crossref","DOI":"10.1145\/3355902","article-title":"The unreasonable fairness of maximum Nash welfare","volume":"7","author":"Caragiannis","year":"2019","journal-title":"ACM Trans. Econ. Comput."},{"key":"10.1016\/j.cor.2026.107575_b12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2018.12.003","article-title":"Lorenz dominance based algorithms to solve a practical multiobjective problem","volume":"104","author":"Chabane","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107575_b13","series-title":"The Concise Encyclopedia of Statistics","first-page":"231","article-title":"Gini index","author":"Dodge","year":"2008"},{"issue":"1","key":"10.1016\/j.cor.2026.107575_b14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01580453","article-title":"Finding efficient points for linear multiple objective programs","volume":"8","author":"Ecker","year":"1975","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107575_b15","series-title":"Multicriteria Optimization. Second edition","author":"Ehrgott","year":"2005"},{"key":"10.1016\/j.cor.2026.107575_b16","series-title":"Algorithmic Decision Theory, 4th International Conference, ADT","first-page":"305","article-title":"Exact methods for computing all lorenz optimal solutions to biobjective problems","volume":"vol. 9346","author":"Galand","year":"2015"},{"issue":"7","key":"10.1016\/j.cor.2026.107575_b17","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1016\/j.cor.2011.09.003","article-title":"Exact algorithms for OWA-optimization in multiobjective spanning tree problems","volume":"39","author":"Galand","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107575_b18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.cor.2019.04.012","article-title":"An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria","volume":"108","author":"Garc\u00eda-Le\u00f3n","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107575_b19","series-title":"Inequalities","author":"Hardy","year":"1952"},{"key":"10.1016\/j.cor.2026.107575_b20","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ejor.2008.02.005","article-title":"An algorithm for optimizing a linear function over an integer efficient set","volume":"195","author":"Jorge","year":"2009","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107575_b21","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.ejor.2015.03.031","article-title":"On the representation of the search region in multi-objective optimization","volume":"245","author":"Klamroth","year":"2015","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107575_b22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1051\/ro:1999112","article-title":"Linear optimization with multiple equitable criteria","volume":"33","author":"Kostreva","year":"1999","journal-title":"RAIRO Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107575_b23","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.ejor.2003.06.010","article-title":"Equitable aggregations and multiple criteria analysis","volume":"158","author":"Kostreva","year":"2004","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107575_b24","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/s00453-018-0434-5","article-title":"The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases","volume":"81","author":"Lesca","year":"2019","journal-title":"Algorithmica"},{"key":"10.1016\/j.cor.2026.107575_b25","series-title":"2011 International Conference on Communications, Computing and Control Applications","first-page":"1","article-title":"Lorenz dominance based metaheuristic to solve a hybrid flowshop scheduling problem with sequence dependent setup times","author":"Li","year":"2011"},{"key":"10.1016\/j.cor.2026.107575_b26","doi-asserted-by":"crossref","first-page":"2248","DOI":"10.1111\/itor.12627","article-title":"Optimizing a linear function over the nondominated set of multiobjective integer programs","volume":"28","author":"Lokman","year":"2019","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.cor.2026.107575_b27","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10898-012-9955-7","article-title":"Finding all nondominated points of multi-objective integer programs","volume":"57","author":"Lokman","year":"2013","journal-title":"J. Global Optim."},{"key":"10.1016\/j.cor.2026.107575_b28","series-title":"Nonlinear Multiobjective Optimization","author":"Miettinen","year":"1999"},{"issue":"2","key":"10.1016\/j.cor.2026.107575_b29","first-page":"1923","article-title":"A multi-objective based direct solution approach for linear programming with intuitionistic fuzzy parameters","volume":"35","author":"Niroomand","year":"2018","journal-title":"J. Intell. Fuzzy Systems"},{"issue":"2","key":"10.1016\/j.cor.2026.107575_b30","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/S0377-2217(99)00240-4","article-title":"Inequality measures and equitable approaches to location problems","volume":"122","author":"Ogryczak","year":"2000","journal-title":"European J. Oper. Res."},{"issue":"12","key":"10.1016\/j.cor.2026.107575_b31","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1287\/mnsc.1100.1248","article-title":"An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs","volume":"56","author":"\u00d6zpeynirci","year":"2010","journal-title":"Manag. Sci."},{"key":"10.1016\/j.cor.2026.107575_b32","unstructured":"Perny, P., Spanjaard, O., 2003. An axiomatic approach to robustness in search problems with multiple scenarios. In: Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence, UAI. pp. 469\u2013476."},{"issue":"1","key":"10.1016\/j.cor.2026.107575_b33","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s10479-006-0073-0","article-title":"A decision-theoretic approach to robust optimization in multivalued graphs","volume":"147","author":"Perny","year":"2006","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2026.107575_b34","series-title":"Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, UAI","first-page":"508","article-title":"Approximation of lorenz-optimal solutions in multiobjective Markov decision processes","author":"Perny","year":"2013"},{"issue":"9","key":"10.1016\/j.cor.2026.107575_b35","doi-asserted-by":"crossref","first-page":"463","DOI":"10.2307\/2025934","article-title":"Utilitarianism and welfarism","volume":"76","author":"Sen","year":"1979","journal-title":"J. Philos."},{"key":"10.1016\/j.cor.2026.107575_b36","series-title":"On Economic Inequality","author":"Sen","year":"1997"},{"issue":"197","key":"10.1016\/j.cor.2026.107575_b37","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2307\/2554117","article-title":"Ranking income distributions","volume":"50","author":"Shorrocks","year":"1983","journal-title":"Economica"},{"key":"10.1016\/j.cor.2026.107575_b38","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/1907319","article-title":"Sur la division pragmatique","volume":"17","author":"Steinhaus","year":"1949","journal-title":"Econometrica"},{"issue":"1","key":"10.1016\/j.cor.2026.107575_b39","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/S0377-2217(03)00255-8","article-title":"A method for finding the set of non-dominated vectors for multiple objective integer linear programs","volume":"158","author":"Sylva","year":"2004","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107575_b40","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1287\/ijoc.2020.0953","article-title":"Enumeration of the nondominated set of multiobjective discrete optimization problems","volume":"33","author":"Tamby","year":"2021","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107575_b41","series-title":"21st International Symposium on Experimental Algorithms, SEA","first-page":"9:1","article-title":"Optimizing over the efficient set of a multi-objective discrete optimization problem","volume":"vol. 265","author":"Tamby","year":"2023"},{"key":"10.1016\/j.cor.2026.107575_b42","first-page":"149","article-title":"The two-phases method: An efficient procedure to solve biobjective combinatorial optimization problems","volume":"20","author":"Ulungu","year":"1995","journal-title":"Found. Comput. Decis. Sci."},{"issue":"1","key":"10.1016\/j.cor.2026.107575_b43","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","article-title":"Equity, envy, and efficiency","volume":"9","author":"Varian","year":"1974","journal-title":"J. Econom. Theory"},{"issue":"1","key":"10.1016\/j.cor.2026.107575_b44","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/21.87068","article-title":"On ordered weighted averaging aggregation operators in multicriteria decision making","volume":"18","author":"Yager","year":"1988","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/j.cor.2026.107575_b45","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00932614","article-title":"Cone convexity, cone extreme points and nondominated solutions in decision problems with multiobjectives","volume":"14","author":"Yu","year":"1974","journal-title":"Journal Optim. Theory Appl."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001930?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001930?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:36:51Z","timestamp":1784893011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":45,"alternative-id":["S0305054826001930"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107575","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":"Optimizing a linear function over the Lorenz-efficient set of multi-objective combinatorial optimization problems","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107575","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107575"}}