Marcos Marreiro Salvatierra

Dr. Marcos Marreiro Salvatierra

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
28 June 2024 in REMAT: Revista Eletrônica da Matemática
Verified
Journal Article
Open access
PDF file
VOVitor Hugo Muniz Oliveira
Vitor Hugo Muniz Oliveira
Andre KrindgesAndre Krindges
Andre Krindges
DMDaniela Ribeiro Monteiro
Daniela Ribeiro Monteiro
JMJoao Frederico da Costa Azevedo Meyer
Joao Frederico da Costa Azevedo Meyer
MSMarcos Marreiro Salvatierra
Marcos Marreiro Salvatierra
This work presents the results of a master's thesis that investigated the impact of a pollutant on the population dynamics of species that interact with each other in the same environment. A system of Dispersion-Migration Partial Differential Equations is presented, which was discretized spatially using the Galerkin Method via Finite Elements and temporally using the Crank-Nicolson Method. The non-linear equations of the system used in modeling and their variational formulations are presented here. The resulting discrete nonlinear system, with which the numerical simulations were carried out, is also presented. This study significantly contributes to understanding the impacts of the presence of polluting materials arising from anthropogenic actions in a given environment, especially with regard to their effects on the population densities of coexisting species.

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 November 2024 in Operations Research Forum
Verified
Journal Article
Closed access
PDF file
MSMarcos Marreiro Salvatierra
Marcos Marreiro Salvatierra
JCJuan Gabriel Colonna
Juan Gabriel Colonna
ANAlcides de C. Amorim Neto
Alcides de C. Amorim Neto

1 August 2022 in Research Square
Verified
Preprint
Open access
PDF file
MSMarcos Marreiro Salvatierra
Marcos Marreiro Salvatierra
JCJuan G. Colonna
Juan G. Colonna
ANAlcides de C. Amorim Neto
Alcides de C. Amorim Neto
We present a method for finding envy-free prices in a combinatorial auction where the consumers’ number n coincides with that of distinct items for sale, each consumer can buy one single item and each item has only one unit available. This is a particular case of the unitdemand envy-free pricing problem , and was recently revisited by Arbib et al. (2019). These authors proved that using a Fibonacci heap for solving the maximum weight perfect matching and the Bellman-Ford algorithm for getting the envy-free prices, the overall time complexity for solving the problem is O ( n 3 ) . We propose a method based on dynamic programming design strategy that seeks the optimal envyfree prices by increasing the consumers’ utilities, which has the same cubic complexity time as the aforementioned approach, but whose theoretical and empirical results indicate that our method performs faster than the shortest paths strategy, obtaining an average time reduction in determining optimal envy-free prices of approximately 48%.

29 November 2024 in Ciência e Natura
Verified
Journal Article
Open access
PDF file
NSNathan Souza da Silva
Nathan Souza da Silva
JMJoao Frederico da Costa Azevedo Meyer
Joao Frederico da Costa Azevedo Meyer
MSMarcos Marreiro Salvatierra
Marcos Marreiro Salvatierra
ACAgbata Benedict Celestine
Agbata Benedict Celestine
CSCarlos Frank Lima dos Santos
Carlos Frank Lima dos Santos
This study employs mathematical and computational approaches to model the interaction between four tree species in a reforestation area. The modeling integrates the diffusion-advection equation with the classical Lotka-Volterra model, which results in a complex system of non-linear partial differential equations. To tackle the complexity of the system, numerical methods, such as the Central Finite Difference Method for the discretization of space and the Crank-Nicolson Method for the discretization of time are employed. The researchers implement these methods using MATLAB software to create an algorithm that generates realistic scenarios over a specified period, and the parameters were estimated based on results extracted from the literature. The generated results provide valuable insights, represented through graphical depictions of approximate solutions in hypothetical scenarios. These visuals allow for the exploration of potential ecological succession trajectories within the environment.

7 January 2026 in Tópicos Educacionais
Verified
Journal Article
Open access
MSMarcos Marreiro Salvatierra
Marcos Marreiro Salvatierra
KBKarla Christina Tribuzy Bandeira
Karla Christina Tribuzy Bandeira
JSJosé Manuel Samo
José Manuel Samo
JRJuan Carlos Rosales
Juan Carlos Rosales
Este ensaio teórico propõe uma reflexão sobre a articulação entre Matemática, religião e transdisciplinaridade na Educação Matemática. Parte-se do reconhecimento de que a disciplina enfrenta uma crise de significado, frequentemente percebida como desvinculada da experiência cotidiana e cultural dos estudantes. A partir de uma abordagem teórico-conceitual fundamentada em D'Ambrosio (2008), Nicolescu (1999) e Geertz (2008), trabalho identifica convergências conceituais entre sistemas matemáticos e religiosos enquanto linguagens de produção de sentido. Como principais proposições, o estudo sustenta que as noções de ordem, infinito, harmonia e transcendência constituem pontos de diálogo entre sistemas matemáticos e religiosos, ambos compreendidos como linguagens estruturantes da experiência humana. Com base nessa articulação, são delineadas diretrizes pedagógicas transdisciplinares que valorizam saberes culturais, integram linguagens artísticas e promovem o diálogo intercultural. Conclui-se que a perspectiva transdisciplinar oferece potencial para ampliar horizontes epistemológicos da Educação Matemática, tornando-a mais significativa e humanizadora.