# Yuri Frota

According to our database

Collaborative distances:

^{1}, Yuri Frota authored at least 32 papers between 2004 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

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.

Electronic Notes in Discrete Mathematics, 2018

2017

A hybrid evolutionary algorithm for task scheduling and data assignment of data-intensive scientific workflows on clouds.

Future Generation Comp. Syst., 2017

Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems.

EURO J. Computational Optimization, 2017

Evaluating balancing on social networks through the efficient solution of correlation clustering problems.

EURO J. Computational Optimization, 2017

A study on exponential-size neighborhoods for the bin packing problem with conflicts.

CoRR, 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 Generation Comp. 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 - Operations Research, 2014

A distributed transportation simplex applied to a Content Distribution Network problem.

RAIRO - Operations Research, 2014

The maximum balanced subgraph of a signed graph: Applications and solution approaches.

European Journal of Operational Research, 2014

A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives.

Discrete Applied Mathematics, 2014

Handling Flash-Crowd Events to Improve the Performance of Web Applications.

CoRR, 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

2012

A Distributed Transportation Simplex Applied to a Content Distribution Network Problem

CoRR, 2012

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.

Electronic Notes in Discrete Mathematics, 2011

The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.

Discrete Applied Mathematics, 2011

2010

A branch-and-cut algorithm for partition coloring.

Networks, 2010

2009

Upper and lower bounding procedures for the minimum caterpillar spanning problem.

Electronic Notes in Discrete Mathematics, 2009

A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.

Electronic Notes in Discrete Mathematics, 2009

An Exact Method for the Minimum Caterpillar Spanning Problem.

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

A Branch-and-Price Approach for the Partition Coloring 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