Yuri Frota
Orcid: 0000-0002-3434-3074
According to our database1,
Yuri Frota
authored at least 43 papers
between 2004 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Robust permutation flow shop total weighted completion time problem: Solution and application to the oil and gas industry.
Comput. Oper. Res., 2023
2022
Expert Syst. Appl., October, 2022
J. Inf. Data Manag., 2022
A Provenance-based Execution Strategy for Variant GPU-accelerated Scientific Workflows in Clouds.
J. Grid Comput., 2022
Eur. J. Oper. Res., 2022
2021
Integer programming formulations and efficient local search for relaxed correlation clustering.
J. Glob. Optim., 2021
2020
Eur. J. Oper. Res., 2020
2019
Discret. Appl. Math., 2019
2018
A study on exponential-size neighborhoods for the bin packing problem with conflicts.
J. Heuristics, 2018
Electron. Notes Discret. Math., 2018
Comput. Optim. Appl., 2018
An Interference-Aware Strategy for Co-locating High Performance Computing Applications in Clouds.
Proceedings of the High Performance Computing Systems - 19th Symposium, 2018
An Interference-Aware Virtual Machine Placement Strategy for High Performance Computing Applications in Clouds.
Proceedings of the Symposium on High Performance Computing Systems, 2018
Proceedings of the High Performance Computing for Computational Science - VECPAR 2018, 2018
2017
Proceedings of the Cloud Computing - Principles, Systems and Applications, Second Edition, 2017
A hybrid evolutionary algorithm for task scheduling and data assignment of data-intensive scientific workflows on clouds.
Future Gener. Comput. Syst., 2017
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems.
EURO J. Comput. Optim., 2017
Evaluating balancing on social networks through the efficient solution of correlation clustering problems.
EURO J. Comput. Optim., 2017
2016
A Dynamic Cloud Dimensioning Approach for Parallel Scientific Workflows: a Case Study in the Comparative Genomics Domain.
J. Grid Comput., 2016
2015
Optimizing virtual machine allocation for parallel scientific workflows in federated clouds.
Future Gener. Comput. Syst., 2015
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015
2014
A distributed transportation simplex applied to a Content Distribution Network problem.
RAIRO Oper. Res., 2014
The maximum balanced subgraph of a signed graph: Applications and solution approaches.
Eur. J. Oper. Res., 2014
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives.
Discret. Appl. Math., 2014
Evaluating Grasp-based cloud dimensioning for comparative genomics: A practical approach.
Proceedings of the 2014 IEEE International Conference on Cluster Computing, 2014
2013
CoRR, 2013
Efficient Solution of the Correlation Clustering Problem: An Application to Structural Balance.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2013 Workshops, 2013
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013
Proceedings of the Euro-Par 2013: Parallel Processing Workshops, 2013
2011
Oper. Res. Lett., 2011
Electron. Notes Discret. Math., 2011
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.
Discret. Appl. Math., 2011
2010
2009
Electron. Notes Discret. Math., 2009
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.
Electron. Notes Discret. Math., 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2004