Iago Augusto Carvalho

Iago Augusto Carvalho
Universidade Federal de Alfenas | UNIFAL · Computer Science Department

Ph.D. in Computer Science
Looking forward for new research collaborators

About

43
Publications
20,541
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
86
Citations
Introduction
I'm currently working as an Adjunct Professor for the Universidade Federal de Alfenas (Brazil) at the Computer Science Department. My research interests concentrate on optimization and operations research and range from exact and heuristic algorithms to statistics and machine learning.
Additional affiliations
June 2021 - present
Universidade Federal de Alfenas
Position
  • Professor (Assistant)
February 2020 - June 2021
University of Campinas
Position
  • PostDoc Position
December 2013 - February 2020
Federal University of Minas Gerais
Position
  • PhD Student
Education
March 2016 - February 2020
Federal University of Minas Gerais
Field of study
  • Computer Science
February 2014 - March 2016
Federal University of Minas Gerais
Field of study
  • Computer Science
March 2011 - February 2014
Federal University of São João del-Rei
Field of study
  • Computer Science

Publications

Publications (43)
Article
Machine learning algorithms are widely used for predicting the consumer response to several food products. Recent studies in the literature demonstrated that it is possible to predict the consumer response to fruits using the physical, chemical, and physical–chemical data of fruits as input for the machine learning algorithms. However, a myriad of...
Article
Full-text available
The most popular and successful way to maintain a healthy body is to have a rich and balanced diet combined with physical exercise. Since the diet dilemma was proposed, several works in the literature suggested calculating a diet that respects the nutritional needs of each person. In the Caloric-Restricted Diet Problem (CRDP), the goal is to find a...
Preprint
Full-text available
The most popular and successful way to maintain a healthy body is to have a rich and balanced diet, combined with physical exercise. Since it was proposed the diet dilemma, several works in the literature suggested calculating a diet that respects an individual's nutritional needs. In the Caloric-Restricted Diet Problem (CRDP), the goal is to find...
Article
Full-text available
The Minmax regret Shortest Path Arborescence problem under interval uncertainty (M-SPA) is a robust counterpart of the Shortest Path Arborescence Problem, where arc costs are modeled as intervals of possible values. This problem finds applications in the design of topologies for low-power wireless personal area networks. Previous work presented a M...
Article
Full-text available
BACKGROUND Strawberry quality is one of the most important factors that guarantees consistent commercialization of the fruit and ensures the consumer's satisfaction. This work makes innovative use of Random Forest (RF) to predict sensory measures of strawberries and to classify them in “satisfied” or “not satisfied” and “would pay more” or “wouldn...
Preprint
Full-text available
Let G=(V,E) be a connected graph, where V and E represent, respectively, the node-set and the edge-set. Besides, let Q \subseteq V be a set of terminal nodes, and r \in Q be the root node of the graph. Given a weight c_{ij} \in \mathbb{N} associated to each edge (i,j) \in E, the Steiner Tree Problem in graphs (STP) consists in finding a minimum-wei...
Conference Paper
Full-text available
Let G = (V, E) be a connected graph, where V and E represent, respectively, the node-set and the edge-set. Besides, let Q ⊆ V be a set of terminal nodes, and r ∈ Q be the root node of the graph. Given a weight c ij ∈ N associated to each edge (i, j) ∈ E, the Steiner Tree Problem in graphs (STP) consists in finding a minimum-weight subgraph of G tha...
Conference Paper
Full-text available
Este trabalho propõe o Problema de Roteamento de Veículos Capacitado com Janelas de Tempo e Clientes Estocásticos (CVRPTWSC), uma variação do Problema de Roteamento de Veículos Capacitado com Janelas de Tempo (CVRPTW) onde um subconjunto dos clientes são incertos. O CVRPTWSC é formulado como um problema de programação linear inteira estocástico em...
Conference Paper
Full-text available
Soccer is the most popular sport in the world and due its popularity, soccer moves billions of euros over the years, in most diverse forms, such as marketing, merchandising, TV quotas and players transfers. As example, in the 2016/2017 season, only England has moved about 1.3 billion of euros only in players transfers. In this work, it is performed...
Article
Full-text available
The objective of this work was to evaluate the expectations of consumers and specialists of craft beers regarding the visual impact of different styles of craft beer served in different beer glasses. An online survey was designed to determine the effect of different shaped glasses on consumer expectations of craft beer. A total of 252 answers from...
Conference Paper
Full-text available
Strawberries' quality greatly varies, and assessing their sensory quality is a costly task. Thus, this work employs physical and physical-chemical data (height, diameter, firmness, color, pH, acidity, and soluble solids) to predict the sensory quality of strawberries. Six sessions, with 30 strawberry samples in total, were performed. A total of 715...
Preprint
Full-text available
We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function coefficients are uncertain. We solve MMR-ILP using a Benders-like Decomposition Algorithm and two metaheuristics for min-max regret problems with interval data. Computatio...
Conference Paper
Full-text available
We address the Interval Data Min-Max Regret 0-1 Integer Linear Programming problem (MMR-ILP), a variant of the 0-1 Integer Linear Programming problem where the objective function coefficients are uncertain. We solve MMR-ILP using a Benders-like Decomposition Algorithm and two metaheuristics for min-max regret problems with interval data. Computatio...
Article
Full-text available
Football is the most popular sport in the world. The growth in the number of transactions of purchase and sale, marketing, sponsorships, sale of tickets, TV contracts, among other forms of monetization of football makes the flow of values increasingly higher. The majority of works related to this sport is associated with sociological analysis. This...
Chapter
We study a problem where k autonomous mobile agents are initially located on distinct nodes of a weighted graph (with n nodes and m edges). Each autonomous mobile agent has a predefined velocity and is only allowed to move along the edges of the graph. We are interested in delivering a package, initially positioned in a source node s, to a destinat...
Preprint
Full-text available
We study a problem where k autonomous mobile agents are initially located on distinct nodes of a weighted graph (with n nodes and m edges). Each autonomous mobile agent has a predefined velocity and is only allowed to move along the edges of the graph. We are interested in delivering a package, initially positioned in a source node s, to a destinat...
Conference Paper
Full-text available
Moore's law provoked decades of advances in com-puter's performance due to transistor's evolution. Despite all success in its improvement, current technology is reaching its physical limits and some replacements are the focus of investigations , such as the Field-Coupled Nanocomputing devices. These devices achieve information transfer and computat...
Conference Paper
Full-text available
Recent studies show that Field-Coupled Nanocomputing devices, such as Quantum-dot Cellular Automata (QCA), can reach ultra-low power consumption, notably when operating with reversible computing techniques. Partially Reversible Pipelined QCA circuits are one of such examples where improving energy efficiency can be balanced with throughput degradin...
Conference Paper
Full-text available
O futebol é hoje o esporte mais popular do mundo. O crescimento no número de transações de compra e venda, marketing, patrocínios, venda de ingressos, contratos de TV, entre outras formas de monetização do futebol faz com que o fluxo de valores seja cada vez maior. Grande parte dos trabalhos relacionados a esse esporte são associados a análises soc...
Article
Full-text available
The min-max regret Shortest Path Tree problem (RSPT) is a NP-Hard Robust Optimization counterpart of the Shortest Path Tree problem, where arcs costs are modeled as intervals of possible values. This problem arises from the uncertainty in link quality the routing protocols for IPv6 Low Wireless Personal Area Networks have to handle. In this paper,...
Conference Paper
Full-text available
In this paper we study the Algorithm Mean Upper (AMU), a simple 2-approximative algorithm that can be applied to any interval data min-max regret optimization problem. We perform computational experiments in more than one thousand instances of three min-max regret optimization problems: the Robust Shortest Path Problem; the Robust Minimum Spanning...
Conference Paper
Full-text available
Uma alimentação rica e balanceada, junto a prática de exercícios físicos, são a forma mais comum e eficaz de obter uma boa forma física e um corpo saudável. Desde o clássico problema da dieta, proposto por Stigler, vários outros trabalhos tiveram como objetivo formular dietas seguindo certo número de restrições. Este trabalho aborda uma variação do...
Conference Paper
Full-text available
A rich and balanced diet, combined with physical exercises, is the most common and efficient manner to achieve a healthy body. Since the classic Diet Problem proposed by Stigler, several works in the literature proposed to compute a diet that respects the nutritional needs of an individual. This work deals with a variation of the Diet Problem, call...
Conference Paper
Full-text available
Heuristics and metaheuristics are known to be sensitive to input parameters. Bat algorithm (BA), a recent optimization metaheuristic, has a great number of input parameters that need to be adjusted in order to increase the quality of the results. Despites the crescent number of works with BA in literature, to the best of our knowledge, there is no...
Article
Given a weight for each network link, which is set by the network operator, the OSPF routing protocol states that the data between each pair of nodes is routed through the shortest path between the sender and the receiver. In the case of multiple shortest paths, the traffic is split evenly, among all outgoing links that belong to the shortest paths...
Conference Paper
O problema da Árvore de Caminhos Mais Curtos Robusta (ACMC-R) é um problema de otimização robusta derivado do problema clássico da Árvore de Caminhos Mais Curtos. O ACMC-R está relacionado a problemas de roteamento em redes 6LoWPAN (IPv6 Low Wireless Personal Area Networks), onde há uma grande incerteza na qualidade dos enlaces. Embora o ACMC-R já...
Data
This is the food table used by the papers in this project. It contains the food products filtered from TACO and their nutrients. After download, please read the README file for more instructions.
Conference Paper
Full-text available
The classical diet problem seeks a diet that respects the indicated nutritional restrictions at a person with the minimal cost. This work presents a variation of this problem, that aims to minimize the number of ingested calories, instead of the financial cost. It aims to generate tasty and hypocaloric diets that also respect the indicated nutritio...
Conference Paper
Full-text available
IPv6 Low Wireless Personal Area Networks (6LoWPAN) is the most promising technology for implementing the Internet of Things (IoT). In order for IoT to become a reality, many challenges still need to be addressed, such as the design of energy-efficient routing protocols. The latter have to be specially resilient to high variations in transmission qu...
Conference Paper
Full-text available
Given a weight for each network link, which is set by the network operator, the OSPF routing protocol states that the data between each pair of nodes is routed through the shortest path between the sender and the receiver. In the case of multiple shortest paths, the traffic is split evenly, among all outgoing links that belong to the shortest paths...
Article
IPv6 Low Wireless Personal Area Networks (6LoWPAN) is the most promising technology for implementing the Internet of Things (IoT). In order for IoT to become a reality, many challenges still need to be addressed, such as the design of energy-efficient routing protocols. The latter have to be specially resilient to high variations in transmission qu...
Conference Paper
Full-text available
Neste trabalho apresentamos um estudo dos parâmetros de entrada de um Algoritmo Genético e um algoritmo de Evolução Diferencial para o ajuste de histórico automático em reservatórios de petróleo. O problema de Ajuste de Histórico é um problema inverso que procura por um conjunto de parâmetros que minimiza a diferença entre o comportamento do modelo...
Conference Paper
Full-text available
A classificação e o ranqueamento de vértices é um tema muito estudado em redes complexas. Existem na literatura diversas métricas utilizadas na classificação de vértices em uma rede. Este trabalho visa comparar as diferentes métricas calculando o coeficiente de correlação entre elas. Resultados demonstram que as métricas Grau e Hub apresentam a mai...
Conference Paper
Full-text available
IPv6 Low Wireless Personal Area Networks (6LoWPAN) is the most promising technology for implementing the Internet of Things (IoT). In order to IoT become a reality, routing protocols have to be resilient to variations in transmission quality, due to constant changes in the network surrounding. The most promising of these protocols is the IPv6 Routi...
Conference Paper
In order to Internet of Things (IoT) become a reality, many challenges still need to be outweighed. Efficient protocols have to be specially resilient to high variations in transmission quality, due to constant changes in the network surrounding, which is characteristic of IoT. The most promising of these protocols is the IPv6 Routing Protocol for...

Network

Cited By

Projects

Projects (4)
Project
This project aims at giving both theoretic and algorithmic contributions to optimization problems under uncertainty. We consider different methodologies for modeling the uncertainty: robust optimization, stochastic programming, and dynamic programming.
Project
This project aims to develop, evaluate, and validate new methods for assessing the quality of solutions given by algorithms. Despite it being mainly focused on computational experiments, most of the results obtained here can be expanded to any other field of the knowledge which relies on empirical experimentation.
Project
In this project, we investigate ways to create and apply reversible computing techniques in Field-Coupled Nanocomputing circuits.