Mario Salvatierra Junior

Dr. Mario Salvatierra Junior


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 September 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
MSMarcos Marreiro Salvatierra
Marcos Marreiro Salvatierra
MJMario Salvatierra Junior
Mario Salvatierra Junior
JCJuan Gabriel Colonna
Juan Gabriel Colonna
In general, the unit-demand envy-free pricing problem has proven to be APX-hard, but some special cases can be optimally solved in polynomial time. When substitution costs that form a metric space are included, the problem can be solved in O(n4) time, and when the number of consumers is equal to the number of items—all with a single copy so that each consumer buys an item—a O(n3) time method is presented to solve it. This work shows that the first case has similarities with the second, and, by exploiting the structural properties of the costs set, it presents a O(n2) time algorithm for solving it when a competitive equilibrium is considered or a O(n3) time algorithm for more general scenarios. The methods are based on a dynamic programming strategy, which simplifies the calculations of the shortest paths in a network; this simplification is usually adopted in the second case. The theoretical results obtained provide efficiency in the search for optimal solutions to specific revenue management problems.

1 January 2024
Verified
Conference Paper
Open access
PDF file
RSRichardsonn Nartan Lima Santos
Richardsonn Nartan Lima Santos
JCJoaquim Maciel da Costa Craveiro
Joaquim Maciel da Costa Craveiro
DRDercio Luiz Reis
Dercio Luiz Reis
MJMario Salvatierra Junior
Mario Salvatierra Junior
TMThiago Maciel
Thiago Maciel
O objetivo deste estudo foi apresentar o que é o Método Analítico Hierárquico, utilizando um software de apoio e mostrar a relevância em como esse método pode demonstrar uma escolha racional e imparcial durante um processo de tomada de decisão, propondo um novo meio rápido para a seleção de candidatos a ocupar um cargo de gerência em uma Instituição Financeira nacional (localizada na cidade de Manaus, Amazonas, no ano corrido de 2022), focando nas competências dos candidatos. Esse modelo de decisão leva em consideração a importância dos critérios escolhidos por quem está à frente da seleção. O resultado da aplicação do MAH foi obtido por meio de uma situação hipotética, levando em consideração três candidatos qualificados para o processo. Com esse método, acredita-se que primeiramente a rotatividade dos colaboradores nos cargos irá diminuir, já que o método aplicado é mais eficiente que os habitualmente aplicados, onde, atualmente, dentro a organização, o método de escolha somente baseia-se em dois critérios: tempo no cargo atual e disponibilidade para assumir a vaga.

31 December 2018 in arXiv
Verified
Preprint
Open access
PDF file
SGSimone Gama
Simone Gama
RFRosiane de Freitas
Rosiane de Freitas
MJMario Salvatierra Junior
Mario Salvatierra Junior
The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, and having some variations as the $(\gamma,\mu)$-coloring, where the color lists have sequential values with known lower and upper bounds. This work discusses the choosability property, that consists in determining the least number $k$ for which it has a proper list coloring no matter how one assigns a list of $k$ colors to each vertex. This is a $\Pi_2^P$-complete problem, however, we show that $k$-$(\gamma,\mu)$-choosability is an $NP$-problem due to its relation with the $k$-coloring of a graph and application of methods of proof in choosability for some classes of graphs, such as complete bipartite graph, which is $ 3 $-choosable, but $ 2 $-$(\gamma,\mu)$-choosable.