Characterization of rankings generated by pseudo-Boolean functions

Characterization of rankings generated by pseudo-Boolean functions

In 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 m of a pseudo-Boolean function and the rankings that can be generated by these insights. Based on a characterization theorem for p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Swarm and evolutionary computation 2024-04, Vol.86, p.101540, Article 101540
Hauptverfasser: Unanue, Imanol, Merino, María, Lozano, Jose A.
Format: Artikel
Sprache:eng
Schlagworte:
Binary-based combinatorial optimization problems
Dyck words
Pseudo-Boolean functions
Rankings
Theoretical analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In 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 m 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 m, several observations are made. First, we verify that pseudo-Boolean functions of degree m
ISSN:2210-6502
DOI:10.1016/j.swevo.2024.101540