Show simple item record

Characterization of rankings generated by pseudo-Boolean functions

dc.contributor.authorUnanue Gual, Imanol
dc.contributor.authorMerino Maestre, María ORCID
dc.contributor.authorLozano Alonso, José Antonio
dc.date.accessioned2024-06-03T08:51:37Z
dc.date.available2024-06-03T08:51:37Z
dc.date.issued2024-03-16
dc.identifier.citationSwarm and Evolutionary Computation 86 : (2024) // Art. ID. 101540es_ES
dc.identifier.issn2210-6502
dc.identifier.issn2210-6510
dc.identifier.urihttp://hdl.handle.net/10810/68311
dc.description.abstractIn this paper we pursue the study of pseudo-Boolean functions as ranking generators. The objective of the work is to find new insights between the relation of the degree of a pseudo-Boolean function and the rankings that can be generated by these insights. Based on a characterization theorem for pseudo-Boolean functions of degree , several observations are made. First, we verify that pseudo-Boolean functions of degree , where is the search space dimension, cannot generate all the possible rankings of the solutions. Secondly, the sufficient condition for a ranking to be generated by a pseudo-Boolean function of dimension is presented, and also the necessary condition is conjectured. Finally, we observe that the same argument is not sufficient to prove which ranking can be generated by pseudo-Boolean functions of degree .es_ES
dc.description.sponsorshipThis research has been partially supported by the Spanish Ministry of Science and Innovation [PID2022-137442NB-I00, PID2019-104933GB-I00 funded by MCIN/AEI/10.13039/501100011033] and BCAM Severo Ochoa accreditation, Spain [CEX2021-001142-S]; the Basque Government, Spain [BERC 2022–2025. IT1504-22, IT1494-22]; and the University of the Basque Country UPV/EHU [GIU20/054]. Open Access funding provided by University of Basque Country.es_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.relationinfo:eu-repo/grantAgreement/MICIN/PID2022-137442NB-I00es_ES
dc.relationinfo:eu-repo/grantAgreement/MICIN/PID2019-104933GB-I00es_ES
dc.rightsinfo:eu-repo/semantics/openAccesses_ES
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.subjectbinary-based combinatorial optimization problemses_ES
dc.subjectpseudo-boolean functionses_ES
dc.subjectrankingses_ES
dc.subjectdyck wordses_ES
dc.subjecttheoretical analysises_ES
dc.titleCharacterization of rankings generated by pseudo-Boolean functionses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.rights.holder© 2024 The Author(s). Published by Elsevier B.V. This article is available under the Creative Commons CC-BY-NC-ND license and permits non-commercial use of the work as published, without adaptation or alteration provided the work is fully attributed.es_ES
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/pii/S2210650224000786es_ES
dc.identifier.doi10.1016/j.swevo.2024.101540
dc.departamentoesMatemáticases_ES
dc.departamentoeuMatematikaes_ES


Files in this item

Thumbnail
Name:
swevo2024_oa.pdf
Size:
606.2Kb
Format:
PDF
Description:
Article
View/Open
Thumbnail
Name:
license_rdf
Size:
811bytes
Format:
application/rdf+xml
View/Open

This item appears in the following Collection(s)

Show simple item record

© 2024 The Author(s). Published by Elsevier B.V. This article is available under the Creative Commons CC-BY-NC-ND license and permits non-commercial use of the work as published, without adaptation or alteration provided the work is fully attributed.
Except where otherwise noted, this item's license is described as © 2024 The Author(s). Published by Elsevier B.V. This article is available under the Creative Commons CC-BY-NC-ND license and permits non-commercial use of the work as published, without adaptation or alteration provided the work is fully attributed.