2024-12-272023-05-24Frontiers in computer sciencehttp://hdl.handle.net/20.500.12272/12046When solving multi-objective combinatorial optimization problems using a search algorithm without a priori information, the result is a Pareto front. Selecting a solution from it is a laborious task if the number of solutions to be analyzed is large. This task would benefit from a systematic approach that facilitates the analysis, comparison and selection of a solution or a group of solutions based on the preferences of the decision makers. In the last decade, the research and development of algorithms for solving multi-objective combinatorial optimization problems has been growing steadily. In contrast, efforts in the a posteriori exploration of non-dominated solutions are still scarce.pdfeninfo:eu-repo/semantics/openAccessAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Search-based software engineeringPreference-based algorithmsAposteriori approachHierarchical clusteringMultiobjective optimizationPareto frontinfo:eu-repo/semantics/articleCasanova Pietroboni, Carlos Antonio ; Schab, Esteban Alejandro ; Prado, Lucas Martín ; Rottoli, Giovanni Daián.No comercial con fines académicos. Licencia Creative Commons CC BY.https://doi.org/10.3389/fcomp.2023.1179059