Yuri Frota

Orcid: 0000-0002-3434-3074

According to our database1, Yuri Frota authored at least 44 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient solutions to the m-machine robust flow shop under budgeted uncertainty.
Ann. Oper. Res., July, 2024

2023
Robust permutation flow shop total weighted completion time problem: Solution and application to the oil and gas industry.
Comput. Oper. Res., 2023

2022
Robust microgrid energy trading and scheduling under budgeted uncertainty.
Expert Syst. Appl., October, 2022

PolRoute-DS: a Crime Dataset for Optimization-based Police Patrol Routing.
J. Inf. Data Manag., 2022

A Provenance-based Execution Strategy for Variant GPU-accelerated Scientific Workflows in Clouds.
J. Grid Comput., 2022

Exact solutions for the two-machine robust flow shop with budgeted uncertainty.
Eur. J. Oper. Res., 2022

2021
Integer programming formulations and efficient local search for relaxed correlation clustering.
J. Glob. Optim., 2021

2020
A new approach for the rainbow spanning forest problem.
Soft Comput., 2020

On the exact solution of vehicle routing problems with backhauls.
Eur. J. Oper. Res., 2020

2019
A note on the rainbow cycle cover problem.
Networks, 2019

A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph.
Discret. Appl. Math., 2019

2018
A study on exponential-size neighborhoods for the bin packing problem with conflicts.
J. Heuristics, 2018

Green Vehicle Routing and Scheduling Problem with Split Delivery.
Electron. Notes Discret. Math., 2018

An exact and heuristic approach for the <i>d</i>-minimum branch vertices problem.
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

A GPU-Based Metaheuristic for Workflow Scheduling on Clouds.
Proceedings of the High Performance Computing for Computational Science - VECPAR 2018, 2018

2017
Mirror Mirror on the Wall, How Do I Dimension My Cloud After All?
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

Brazilian Congress structural balance analysis.
CoRR, 2016

2015
Optimizing virtual machine allocation for parallel scientific workflows in federated clouds.
Future Gener. Comput. Syst., 2015

Detecting and Handling Flash-Crowd Events on Cloud Environments.
CoRR, 2015

An ILS algorithm to evaluate structural balance in signed social networks.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Handling flash-crowd events to improve the performance of web applications.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

2014
Integer programming approaches for minimum stabbing problems.
RAIRO Oper. Res., 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
An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph.
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

Solution of the Maximum $$k$$ k -Balanced Subgraph Problem.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Optimization of a Cloud Resource Management Problem from a Consumer Perspective.
Proceedings of the Euro-Par 2013: Parallel Processing Workshops, 2013

2011
A branch-and-price approach for the partition coloring problem.
Oper. Res. Lett., 2011

New branch-and-bound algorithms for k-cardinality tree problems.
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
A branch-and-cut algorithm for partition coloring.
Networks, 2010

2009
Upper and lower bounding procedures for the minimum caterpillar spanning problem.
Electron. Notes Discret. Math., 2009

A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.
Electron. Notes Discret. Math., 2009

An Exact Method for the Minimum Caterpillar Spanning Problem.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2004
Cliques, holes and the vertex coloring polytope.
Inf. Process. Lett., 2004


  Loading...