PageSourceSearch

https://fdecpereira.github.io/

html fdecpereira.github.io collected 2026-10-03 09:11:09 UTC 15,349 bytes, 292 lines download raw bytes

1<!DOCTYPE html>
2<html lang="en-US">
3  <head>
4    <title>Felipe de C. Pereira | Amazon<br></title>
5
6    <meta charset="UTF-8">
7    <meta http-equiv="X-UA-Compatible" content="IE=edge">
8    <meta name="viewport" content="width=device-width, initial-scale=1">
9    <meta name="description" content="Felipe de C. Pereira's personal homepage.">
10    
11    <meta name="keywords" content="Felipe Pereira UFS UNICAMP LOCo Amazon Applied Scientist Optimization">
12    
13    
14    <link rel="canonical" href="https://minimal-light-theme.yliu.me/"/>
15    
16
17    <link rel="icon" media="(prefers-color-scheme:dark)" href="assets/img/favicon_dark.ico" type="image/png" />
18    <link rel="icon" media="(prefers-color-scheme:light)" href="assets/img/favicon.ico" type="image/png" />
19    
19<script src="./assets/js/favicon-switcher.js" type="application/javascript"></script>
19
20
21    <link rel=stylesheet href=https://cdnjs.cloudflare.com/ajax/libs/academicons/1.8.6/css/academicons.min.css integrity="sha256-uFVgMKfistnJAfoCUQigIl+JfUaP47GrRKjf6CTPVmw=" crossorigin=anonymous>
22    <link rel=stylesheet href=https://cdnjs.cloudflare.com/ajax/libs/font-awesome/5.11.2/css/all.min.css integrity="sha256-+N4/V/SbAFiW1MPBCXnfnP9QSN3+Keu+NlB+0ev/YKQ=" crossorigin=anonymous>
23
24    
25    <link rel="stylesheet" href="./assets/css/font.css">
26    
27    
28    <link rel="stylesheet" href="./assets/css/style.css">
29    <link rel="stylesheet" href="./assets/css/publications.css">
30    
31
32  </head>
33  <body>
34    <div class="wrapper">
35      <header>
36        
37        
38        <a class="image avatar"><img src="assets/img/profile_picture_3.jpeg" alt="avatar" /></a>
39        
40
41        <h1>Felipe de C. Pereira</h1>
42
43        
44        <position style="font-size:1.10rem;">Applied Scientist II</position>
45        <br>
46        
47        
48        <a href="https://www.amazon.science/tag/supply-chain-optimization-technologies"  target="_blank" rel="noopener"><autocolor>Amazon<br></autocolor></a>
49        <br>
50        <!--
51        
52        
53        <email>[email protected]</email>
54        
55        -->
56        <picture>
57          <source srcset="assets/img/email_dark.png" media="(prefers-color-scheme:dark)">
58          <img src="assets/img/email.png" style="width:150px;">
59        </picture>
60        <br>
61        <br>
62        <div class="social-icons">
63        
64        <a style="margin: 0 5px 0 0" href="https://scholar.google.com.br/citations?user=p7oApAYAAAAJ" target="_blank">
65          <i class="ai ai-google-scholar" style="font-size:1.2rem"></i>
66        </a>  
67        
68
69        
70
71        
72        <a style="margin: 0 5px 0 0" href="https://github.com/fdecpereira" target="_blank">
73          <i class="fab fa-github"></i>
74        </a>
75        
76
77        
78        <a style="margin: 0 5px 0 0" href="https://www.linkedin.com/in/fdecpereira" target="_blank">
79          <i class="fab fa-linkedin"></i>
80        </a>
81        
82
83        
84        </div>
85        <br>
86
87      </header>
88      <section>
89
90      <h2 id="bio">Bio</h2>
91
92<p>I am an Applied Scientist at Amazon in Vancouver, Canada. As a member of the Fulfillment Optimization (FO) team within the <a href="https://www.amazon.science/tag/supply-chain-optimization-technologies" target="_blank">Supply Chain Optimization Technologies (SCOT)</a> organization, I design and develop optimization algorithms to improve the efficiency and effectiveness of Amazon’s logistics network, helping customers receive their orders faster and at lower cost.</p>
93
94<p>I hold an MSc and a PhD in Computer Science from the <a href="https://ic.unicamp.br/en/" target="_blank">Institute of Computing (IC)</a> at the <a href="https://www.unicamp.br/en/" target="_blank">University of Campinas (UNICAMP)</a>, where I specialized in Combinatorial Optimization. During my graduate studies, I was a member of the <a href="https://loco.ic.unicamp.br/" target="_blank">Laboratory of Optimization and Combinatorics (LOCo)</a>. I also hold a BSc in Computer Science from the <a href="https://en.ufs.br/pagina/21114" target="_blank">Federal University of Sergipe (UFS)</a>.</p>
95
96<p>Before joining Amazon, I was an Assistant Professor in the Department of Computing at UFS, in the area of Theory of Computation and Algorithms.</p>
97
98<h2 style="margin-top:50px;"> Research Interests</h2>
99
100<p>My research interests cover combinatorial optimization, operations research, and theoretical computer science. I am particularly interested in exact algorithms based on mathematical programming, including linear, integer, and constraint programming, as well as heuristic approaches such as metaheuristics and matheuristics. My master’s and doctoral research focused on combinatorial optimization problems involving information diffusion in online social networks.</p>
101
102<h2 style="margin-top:50px;"> Education </h2>
103
104<div>
105<strong>[2021 - 2024] PhD in Computer Science, University of Campinas, Brazil</strong><br />
106 PhD Thesis: <a href="https://hdl.handle.net/20.500.12733/28293" target="_blank"> Exact Algorithms and Heuristics for Optimization Problems on the Spread of Information on Social Networks</a><br />
107 Advisor: <a href="https://www.ic.unicamp.br/~rezende/" target="_blank">
107 Pedro J. de Rezende</a> (University of Campinas, Brazil)<br />
108 Co-advisor: <a href="https://thyunes.github.io/" target="_blank"> Tallys Yunes</a> (University of Miami, US)<br />
109 Visiting Research Scholar at the <a href="https://www.herbert.miami.edu/faculty-research/academic-departments/management-science/index.html" target="_blank"> Miami Herbert's Department of Management Science</a>, University of Miami, US (Feb/2023 - Apr/2023)
110</div>
111
112<div style="margin-top:20px;">
113<strong>[2019 - 2021] MSc in Computer Science, University of Campinas, Brazil</strong><br />
114 Master's Thesis: <a href="https://hdl.handle.net/20.500.12733/1641217" target="_blank"> A computational study of the Perfect Awareness Problem</a><br />
115 Advisor: <a href="https://www.ic.unicamp.br/~rezende/" target="_blank"> Pedro J. de Rezende</a> (University of Campinas, Brazil)<br />
116 Co-advisor: <a href="https://www.ic.unicamp.br/~cid/" target="_blank"> Cid C. de Souza</a> (Mercado Libre, Brazil)<br />
117</div>
118
119<div style="margin-top:20px;">
120<strong>[2015 - 2019] BSc in Computer Science, Federal University of Sergipe, Brazil</strong><br />
121Bachelor's Thesis: An investigation of the Knapsack Median Problem with Integer Linear Programming<br />
122Advisor: <a href="https://lattes.cnpq.br/4874119345201234" target="_blank"> Breno P. Ribeiro</a> (Federal University of Sergipe, Brazil)
123</div>
124
125<h2 style="margin-top:50px;">Experience</h2>
126
127<div>
128<strong>[Dec/2025 - present] Applied Scientist II at Amazon, Vancouver, Canada </strong><br />
129FO - SCOT
130</div>
131
132<div style="margin-top:20px;">
133<strong>[Mar/2025 - Dec/2025] Professor at the Federal University of Sergipe, Brazil</strong><br />
134Theory of Computation and Algorithms<br />
135Courses taught: Design and Analysis of Algorithms, Data Structures, and Imperative Programming.
136</div>
137
138<div style="margin-top:20px;">
139<strong>[Oct/2024 - Jan/2025] Applied Scientist Intern at Amazon, Bellevue, US</strong><br />
140FO - SCOT
141</div>
142
143<div style="margin-top:20px;">
144<strong>[2020 - 2024] Graduate Teaching Assistant at the University of Campinas, Brazil</strong><br />
145Courses:  Mathematical Foundations of Computing (6 semesters) and Design and Analysis
146of Algorithms (1 semester)
147</div>
148
149<div style="margin-top:20px;">
150<strong>[Jul/2018 - Feb/2019] Web Developer at <a href="https://www.linkedin.com/company/softeam-ejc/" target="_blank"> Software Team</a> (junior company), Brazil </strong><br />
151Developed a WordPress/PHP website for Baré Júnior - Federation of Junior Companies of the State of Amazonas
152</div>
153
154<div style="margin-top:20px;">
155<strong>[2017 - 2018] Teaching Assistant at the Federal University of Sergipe, Brazil</strong><br />
156Course:  Imperative Programming (4 semesters) 
157</div>
158
159<h2 style="margin-top:50px;">Publications</h2>
160
161<div>
162<strong><a href="https://doi.org/10.5753/etc.2025.9069" target="_blank">[2025] A Lagrangian Relaxation for the Generalized Target Set Selection Problem</a></strong><br />
163<strong>Felipe de C. Pereira</strong>, Pedro J. de Rezende, and Tallys Yunes<br />
164<em>Conference: X Theory of Computation Meeting of the Brazilian Computer Society (ETC/CSBC 2025)</em><br />
165</div>
166
167<div style="margin-top:20px;">
168<strong><a href="https://doi.org/10.4230/LIPIcs.ESA.2024.94" target="_blank">[2024] A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs</a></strong><br />
169<strong>Felipe de C. Pereira</strong>, Pedro J. de Rezende, Tallys Yunes, and Luiz F. B. Morato<br />
170<em>Conference: 32nd Annual European Symposium on Algorithms (ESA 2024)</em><br />
171</div>
172
173<div style="margin-top:20px;">
174<strong><a href="https://doi.org/10.1007/978-3-031-60599-4_7" target="_blank">[2024] Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches</a></strong><br />
175<strong>Felipe de C. Pereira</strong>, Pedro J. de Rezende, and Tallys Yunes<br />
176<em>Conference: 21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2024)</em><br />
177</div>
178
179<div style="margin-top:20px;">
180<strong><a href="https://doi.org/10.1016/j.osnem.2023.100255" target="_blank">[2023] The Least Cost Directed Perfect Awareness Problem: complexity, algorithms and computations</a></strong><br />
181<strong>Felipe de C. Pereira</strong>, and Pedro J. de Rezende<br />
182<em>Journal: Online Social Networks and Media</em><br />
183</div>
184
185<div style="margin-top:20px;">
186<strong><a href="https://doi.org/10.5753/ctd.2022.222955" target="_blank">[2022] A Computational Study of the Perfect Awareness Problem</a></strong><br />
187<strong>Felipe de C. Pereira</strong>, Pedro J. de Rezende, and Cid C. de Souza<br />
188<em>Conference: XXXV Theses and Dissertations Contest of the Brazilian Computer Society (CTD/CSBC 2022)</em><br />
189</div>
190
191<div style="margin-top:20px;">
192<strong><a href="https://doi.org/10.1016/j.procs.2021.11.059" target="_blank">[2021] Effective Heuristics for the Perfect Awareness Problem</a></strong><br />
193<strong>Felipe de C. Pereira</strong>, Pedro J. de Rezende, and Cid C. de Souza<br />
194<em>Conference: XI Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2021)</em><br />
195</div>
196
197<div style="margin-top:20px;">
198<strong>[2020] Exact Algorithms and Heuristics for the Perfect
199Awareness Problem (<a href="https://www.ime.usp.br/~latin2020/posters/poster05.pdf" target="_blank">poster</a> and <a href="https://latin2020.ime.usp.br/posters/resumo05.pdf" target="_blank">abstract</a>)</strong><br />
200<strong>Felipe de C. Pereira</strong>, Pedro J. de Rezende, and Cid C. de Souza<br />
201<em>Conference: 14th Latin American Theoretical Informatics Symposium (LATIN 2020)</em><br />
202</div>
203
204<div style="margin-top:20px;">
205<strong><a href="https://doi.org/10.1007/978-3-319-96151-4_3" target="_blank">[2018] The Next Release Problem: Complexity,
206Exact Algorithms and Computations</a></strong><br />
207José C. A. Júnior, <strong>Felipe de C. Pereira</strong>, Marina V. A. Reis, and Breno P. Ribeiro<br />
208<em>Conference: X International Symposium on Combinatorial Optimization (ISCO 2018)</em><br />
209</div>
210
211<h2 style="margin-top:50px;">Technical Skills</h2>
212<p><strong>Natural languages: Portuguese and English<br />
213<strong>Programming languages:</strong> C, C++, Python and R<br />
214<strong>Commercial and open solvers:</strong>
214 Gurobi, CPLEX, CP-SAT (Google OR-Tools), and Hexaly</strong></p>
215
216<h2 style="margin-top:50px;">Awards and Honors</h2>
217
218<p><strong>[2025] Second-place prize in the <a href="https://clei.org/en/latin-american-doctoral-thesis-contest/" target="_blank"> XI Latin American Doctoral Thesis Contest of the Latin American Center for Informatics Studies (CLTD/CLEI 2025)</a></strong><br /></p>
219
220<p><strong>[2023] First-place prize in the UniSoma Challenge, a hackathon in mathematical optimization</strong><br />
221Team: <strong>Felipe de C. Pereira</strong>, Ana P. S. Dantas and Klairton de L. Brito</p>
222
223<p><strong>[2022] Third-place prize in the <a href="https://csbc.sbc.org.br/2022/ctd/" target="_blank"> XXXV Contest of Theses and Dissertations of the Brazilian Computer Society (CTD/CSBC 2022)</a></strong><br />
224Category: Master’s theses<br /></p>
225
226<p><strong>[2017] Honorable Mention in the ACM ICPC - Brazilian Finals</strong><br />
227Team: Marina V. A. Reis, João V. R. Viana and <strong>Felipe de C. Pereira</strong><br />
228Coach: André B. de Carvalho</p>
229
230<p><strong>[2016] Honorable Mention in the ACM ICPC - Brazilian First Phase</strong><br />
231Team: José C. A. Júnior, Adam L. P. da Silva, and <strong>Felipe de C. Pereira</strong><br />
232Coach: Beatriz T. Andrade | Co-coach: Gilberto A. dos Santos</p>
233
234<p><strong>[2015] Honorable Mention in the ACM ICPC - Brazilian First Phase</strong><br />
235Team: Adam L. P. da Silva, Marina V. A. Reis and <strong>Felipe de C. Pereira</strong><br />
236Coach: Beatriz T. Andrade</p>
237
238<p><strong>[2018] Third-place prize in the Programming Contest of the XVIII Escola Regional de Computação Bahia, Alagoas e Sergipe (ERBASE 2018)</strong><br />
239Team: <strong>Felipe de C. Pereira</strong>, João V. R. Viana and Vinícius da C. Daltro</p>
240
241<p><strong>[2009-2014] Several medals in the Brazilian Olympiads in Mathematics and Computing</strong></p>
242
243<h2 style="margin-top:50px;">Service to the Scientific Community</h2>
244
245<div>
246Reviewer for the <a href="https://pubsonline.informs.org/journal/ijoc" target="_blank">INFORMS Journal on Computing</a> (1 paper)
247</div>
248
249<div style="margin-top:15px;">
250Reviewer for the <a href="https://link.springer.com/journal/10732" target="_blank">Journal of Heuristics</a> (1 paper)
251</div>
252
253<div style="margin-top:15px;">
254Subreviewer for the <a href="https://sites.google.com/view/cpaior2024" target="_blank">21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2024)</a> (2 papers)
255</div>
256
257<div style="margin-top:15px;">
258Reviewer for the <a href="https://erbase.sbc.org.br/2025/templates/pesqbase.html" target="_blank">Research Workshop of the XXV Escola Regional de Computação Bahia, Alagoas e Sergipe (ERBASE 2025)</a> (4 papers)
259</div>
260
261<!-- <h2 style="margin-top:50px"> Postal Address</h2>
262
263Department of Computing -- Federal University of Sergipe<br>
264<a href="https://maps.app.goo.gl/RiQmnX6URmSR2K2AA" target="_blank">
265Cidade Univ. Prof. José Aloísio de Campos <br>
266São Cristóvão, Sergipe, Brazil, 49107-230 </a> -->
267
268
269      <br>
270
271      
272      <p><small>Powered by Jekyll and <a href="https://github.com/yaoyao-liu/minimal-light" target="_blank" rel="noopener">Minimal Light</a> theme.</small></p>
273      
274
275      </section>
276      <footer>
277        
278      </footer>
279    </div>
280    
280<script src="/assets/js/scale.fix.js"></script>
280
281    
282    
282<script>
vendor: 364 bytes, lines 282-287
282
283      (function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
284      (i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
285      m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
286      })(window,document,'script','https://www.google-analytics.com/analytics.js','ga');
287      ga('create', '
287UA-111540567-4
vendor: 46 bytes, lines 287-289
287', 'auto');
288      ga('send', 'pageview');
289    
289</script>
289
290    
291  </body>
292</html>

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.