Search Results for author:
Found 4 papers, 1 papers with code
Exact and approximate determination of the Pareto set using minimal correction subsets
First, we show that it is possible to use MCS enumeration to solve MOBO problems such that each MCS necessarily corresponds to a Pareto-optimal solution.
Sparsifying Parity-Check Matrices
Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels.
The {0,1}-knapsack problem with qualitative levels
A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level.
A robust hierarchical nominal classification method based on similarity and dissimilarity using loss function and an improved version of the deck of cards method
We propose also a procedure, based on the concept of loss function, to obtain a final classification fulfilling some requirements given by the decision maker and taking into account the hierarchy of criteria and the probabilistic assignments obtained applying SMAA.
