Follow
Yuri Frota
Yuri Frota
Professor of Computer Science, Fluminense Federal University
Verified email at ic.uff.br - Homepage
Title
Cited by
Cited by
Year
Cliques, holes and the vertex coloring polytope
M Campêlo, R Corrêa, Y Frota
Information Processing Letters 89 (4), 159-164, 2004
1002004
Optimizing virtual machine allocation for parallel scientific workflows in federated clouds
RC Coutinho, LMA Drummond, Y Frota, D de Oliveira
Future Generation Computer Systems 46, 51-68, 2015
642015
A hybrid evolutionary algorithm for task scheduling and data assignment of data-intensive scientific workflows on clouds
L Teylo, U de Paula, Y Frota, D de Oliveira, LMA Drummond
Future Generation Computer Systems 76, 1-17, 2017
622017
A branch‐and‐cut algorithm for partition coloring
Y Frota, N Maculan, TF Noronha, CC Ribeiro
Networks: An International Journal 55 (3), 194-204, 2010
552010
The maximum balanced subgraph of a signed graph: Applications and solution approaches
R Figueiredo, Y Frota
European Journal of Operational Research 236 (2), 473-487, 2014
492014
Evaluating balancing on social networks through the efficient solution of correlation clustering problems
M Levorato, R Figueiredo, Y Frota, L Drummond
EURO Journal on Computational Optimization 5 (4), 467-498, 2017
352017
Green vehicle routing and scheduling problem with split delivery
MRS Matos, Y Frota, LS Ochi
Electronic Notes in Discrete Mathematics 69, 13-20, 2018
322018
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
L Bahiense, Y Frota, TF Noronha, CC Ribeiro
Discrete Applied Mathematics 164, 34-46, 2014
312014
A study on exponential-size neighborhoods for the bin packing problem with conflicts
R Capua, Y Frota, LS Ochi, T Vidal
Journal of Heuristics 24, 667-695, 2018
282018
On the exact solution of vehicle routing problems with backhauls
E Queiroga, Y Frota, R Sadykov, A Subramanian, E Uchoa, T Vidal
European Journal of Operational Research 287 (1), 76-89, 2020
262020
An ils algorithm to evaluate structural balance in signed social networks
M Levorato, L Drummond, Y Frota, R Figueiredo
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 1117-1122, 2015
262015
Optimization of a cloud resource management problem from a consumer perspective
R de C. Coutinho, LMA Drummond, Y Frota
Euro-Par 2013: Parallel Processing Workshops: BigDataCloud, DIHC, FedICI …, 2014
262014
A branch-and-price approach for the partition coloring problem
EA Hoshino, YA Frota, CC De Souza
Operations Research Letters 39 (2), 132-137, 2011
262011
Efficient solution of the correlation clustering problem: An application to structural balance
L Drummond, R Figueiredo, Y Frota, M Levorato
On the Move to Meaningful Internet Systems: OTM 2013 Workshops: Confederated …, 2013
222013
The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
L Simonetti, Y Frota, CC de Souza
Discrete applied mathematics 159 (16), 1901-1914, 2011
222011
Exact solutions for the two-machine robust flow shop with budgeted uncertainty
M Levorato, R Figueiredo, Y Frota
European Journal of Operational Research 300 (1), 46-57, 2022
202022
Handling flash-crowd events to improve the performance of web applications
U de Paula Junior, LMA Drummond, D de Oliveira, Y Frota, VC Barbosa
Proceedings of the 30th annual ACM symposium on applied computing, 769-774, 2015
152015
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.
L Bahiense, Y Frota, N Maculan, TF Noronha, CC Ribeiro
Electron. Notes Discret. Math. 35, 347-352, 2009
122009
Integer programming formulations and efficient local search for relaxed correlation clustering
E Queiroga, A Subramanian, R Figueiredo, Y Frota
Journal of Global Optimization 81 (4), 919-966, 2021
112021
An interference-aware virtual machine placement strategy for high performance computing applications in clouds
MM Alves, L Teylo, Y Frota, LMA Drummond
2018 Symposium on High Performance Computing Systems (WSCAD), 94-100, 2018
92018
The system can't perform the operation now. Try again later.
Articles 1–20