Algorithms and complexity results for the 0-1 knapsack problem with group fairness

Data de publicació electrònica: 10-09-2025

Detalles Bibliográficos
Autores: Malaguti, Enrico, Paronuzzi, Paolo, Santini, Alberto
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2025
País:España
Institución:Universitat Pompeu Fabra
Repositorio:Repositorio Digital de la UPF
OAI Identifier:oai:repositori.upf.edu:10230/71657
Acceso en línea:http://hdl.handle.net/10230/71657
https://dx.doi.org/10.1007/s11590-025-02252-y
Access Level:acceso abierto
Palabra clave:Packing
Knapsack problems
Fairness
Integer linear programming
Dynamic programming
id ES_db32a6dd3b6be5e5edeb9733c851dc01
oai_identifier_str oai:repositori.upf.edu:10230/71657
network_acronym_str ES
network_name_str España
repository_id_str
spelling Algorithms and complexity results for the 0-1 knapsack problem with group fairnessMalaguti, EnricoParonuzzi, PaoloSantini, AlbertoPackingKnapsack problemsFairnessInteger linear programmingDynamic programmingData de publicació electrònica: 10-09-2025This paper presents an exact algorithm for a generalisation of the classical 0-1 Knapsack Problem, called the Knapsack Problem with Group Fairness. In this problem, items are partitioned into classes, and fairness constraints affect the number of items that can or must be chosen from each class. The problem was introduced by Patel et al. (in: Dignum (eds) Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 2021), where approximation algorithms are discussed. This paper describes the first exact solution approaches for the Knapsack Problem with Group Fairness, based on integer linear programming formulations and a dynamic programming algorithm. The latter allows us to establish the complexity of the problem. Finally, a set of computational experiments on benchmark instances derived from the knapsack literature compare the effectiveness of the alternative solution approaches.Alberto Santini was funded by the Spanish Ministry of Science, Innovation and Universities and by the European Social Fund Plus (ESF+) through grant RYC2022-035269-I via MCIN/AEI/10.13039/501100011033 of the "Ramón y Cajal" programme and through grant PID2024-161521OA-I00 of the programme "Proyectos de Generación de Conocimiento 2024" of the Spanish Ministry of Science, Innovation and Universities. Enrico Malaguti and Paolo Paronuzzi were funded by the Air Force Office of Scientific Research under award number FA8655-25-1-7013.Springer2025202520252025info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/10230/71657https://dx.doi.org/10.1007/s11590-025-02252-yreponame:Repositorio Digital de la UPFinstname:Universitat Pompeu FabraInglésOptimization Letters. 2025 Oct 6info:eu-repo/grantAgreement/ES/4PE/PID2024-161521OA-I00This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.http://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessoai:repositori.upf.edu:10230/716572026-06-12T07:21:37Z
dc.title.none.fl_str_mv Algorithms and complexity results for the 0-1 knapsack problem with group fairness
title Algorithms and complexity results for the 0-1 knapsack problem with group fairness
spellingShingle Algorithms and complexity results for the 0-1 knapsack problem with group fairness
Malaguti, Enrico
Packing
Knapsack problems
Fairness
Integer linear programming
Dynamic programming
title_short Algorithms and complexity results for the 0-1 knapsack problem with group fairness
title_full Algorithms and complexity results for the 0-1 knapsack problem with group fairness
title_fullStr Algorithms and complexity results for the 0-1 knapsack problem with group fairness
title_full_unstemmed Algorithms and complexity results for the 0-1 knapsack problem with group fairness
title_sort Algorithms and complexity results for the 0-1 knapsack problem with group fairness
dc.creator.none.fl_str_mv Malaguti, Enrico
Paronuzzi, Paolo
Santini, Alberto
author Malaguti, Enrico
author_facet Malaguti, Enrico
Paronuzzi, Paolo
Santini, Alberto
author_role author
author2 Paronuzzi, Paolo
Santini, Alberto
author2_role author
author
dc.subject.none.fl_str_mv Packing
Knapsack problems
Fairness
Integer linear programming
Dynamic programming
topic Packing
Knapsack problems
Fairness
Integer linear programming
Dynamic programming
description Data de publicació electrònica: 10-09-2025
publishDate 2025
dc.date.none.fl_str_mv 2025
2025
2025
2025
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10230/71657
https://dx.doi.org/10.1007/s11590-025-02252-y
url http://hdl.handle.net/10230/71657
https://dx.doi.org/10.1007/s11590-025-02252-y
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Optimization Letters. 2025 Oct 6
info:eu-repo/grantAgreement/ES/4PE/PID2024-161521OA-I00
dc.rights.none.fl_str_mv http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:Repositorio Digital de la UPF
instname:Universitat Pompeu Fabra
instname_str Universitat Pompeu Fabra
reponame_str Repositorio Digital de la UPF
collection Repositorio Digital de la UPF
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869421651992510464
score 15,811543

Similares en LA Referencia