default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri Frota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Mario Levorato
, David Sotelo, Rosa Figueiredo, Yuri Frota:
Efficient solutions to the m-machine robust flow shop under budgeted uncertainty. Ann. Oper. Res. 338(1): 765-799 (2024)- 2023
- [j29]Mario Levorato, David Sotelo, Rosa Figueiredo, Yuri Frota:
Robust permutation flow shop total weighted completion time problem: Solution and application to the oil and gas industry. Comput. Oper. Res. 151: 106117 (2023) - 2022
- [j28]Mario Levorato, Rosa Figueiredo, Yuri Frota:
Exact solutions for the two-machine robust flow shop with budgeted uncertainty. Eur. J. Oper. Res. 300(1): 46-57 (2022) - [j27]Mario Levorato, Rosa Figueiredo, Yuri Frota:
Robust microgrid energy trading and scheduling under budgeted uncertainty. Expert Syst. Appl. 203: 117471 (2022) - [j26]Murilo B. Stockinger, Marcos A. Guerine, Ubiratam de Paula Junior, Filipe Santiago, Yuri Frota, Isabel Rosseti, Alexandre Plastino, Daniel de Oliveira:
A Provenance-based Execution Strategy for Variant GPU-accelerated Scientific Workflows in Clouds. J. Grid Comput. 20(4): 36 (2022) - [j25]Bruno Cunha Sá, Gustavo Muller, Maicon Banni, Wagner Santos, Marcos Lage, Isabel Rosseti, Yuri Frota, Daniel de Oliveira:
PolRoute-DS: a Crime Dataset for Optimization-based Police Patrol Routing. J. Inf. Data Manag. 13(1) (2022) - 2021
- [j24]Eduardo Queiroga, Anand Subramanian, Rosa Figueiredo, Yuri Frota:
Integer programming formulations and efficient local search for relaxed correlation clustering. J. Glob. Optim. 81(4): 919-966 (2021) - 2020
- [j23]Eduardo Queiroga, Yuri Frota, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa, Thibaut Vidal:
On the exact solution of vehicle routing problems with backhauls. Eur. J. Oper. Res. 287(1): 76-89 (2020) - [j22]Jorge Moreno, Simone Martins, Yuri Frota:
A new approach for the rainbow spanning forest problem. Soft Comput. 24(5): 3771-3780 (2020)
2010 – 2019
- 2019
- [j21]Rosa Figueiredo, Yuri Frota, Martine Labbé:
A branch-and-cut algorithm for the maximum k-balanced subgraph of a signed graph. Discret. Appl. Math. 261: 164-185 (2019) - [j20]Jorge Moreno, Simone Martins, Yuri Frota:
A note on the rainbow cycle cover problem. Networks 73(1): 38-47 (2019) - 2018
- [j19]Jorge Moreno, Yuri Frota, Simone Martins:
An exact and heuristic approach for the d-minimum branch vertices problem. Comput. Optim. Appl. 71(3): 829-855 (2018) - [j18]Marcos Raylan Sousa Matos, Yuri Frota, Luiz Satoru Ochi:
Green Vehicle Routing and Scheduling Problem with Split Delivery. Electron. Notes Discret. Math. 69: 13-20 (2018) - [j17]Renatha Capua, Yuri Frota, Luiz Satoru Ochi, Thibaut Vidal:
A study on exponential-size neighborhoods for the bin packing problem with conflicts. J. Heuristics 24(4): 667-695 (2018) - [c11]Elliod Cieza, Luan Teylo, Yuri Frota, Cristiana Bentes, Lúcia M. A. Drummond:
A GPU-Based Metaheuristic for Workflow Scheduling on Clouds. VECPAR 2018: 62-76 - [c10]Maicon Melo Alves, Luan Teylo, Yuri Frota, Lúcia Maria de A. Drummond:
An Interference-Aware Strategy for Co-locating High Performance Computing Applications in Clouds. WSCAD (Selected Papers) 2018: 3-20 - [c9]Maicon Melo Alves, Luan Teylo, Yuri Frota, Lúcia M. A. Drummond:
An Interference-Aware Virtual Machine Placement Strategy for High Performance Computing Applications in Clouds. WSCAD 2018: 94-100 - 2017
- [j16]Mario Levorato, Rosa Figueiredo, Yuri Frota, Lúcia M. A. Drummond:
Evaluating balancing on social networks through the efficient solution of correlation clustering problems. EURO J. Comput. Optim. 5(4): 467-498 (2017) - [j15]Mario Levorato, Rosa Figueiredo, Yuri Frota, Lúcia M. A. Drummond:
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems. EURO J. Comput. Optim. 5(4): 499 (2017) - [j14]Luan Teylo, Ubiratam de Paula Junior, Yuri Frota, Daniel de Oliveira, Lúcia M. A. Drummond:
A hybrid evolutionary algorithm for task scheduling and data assignment of data-intensive scientific workflows on clouds. Future Gener. Comput. Syst. 76: 1-17 (2017) - [p1]Rafaelli de C. Coutinho, Yuri Frota, Kary A. C. S. Ocaña, Daniel de Oliveira, Lúcia M. A. Drummond:
Mirror Mirror on the Wall, How Do I Dimension My Cloud After All? Cloud Computing, 2nd Ed. 2017: 27-58 - [i6]Renatha Capua, Yuri Frota, Luiz Satoru Ochi, Thibaut Vidal:
A study on exponential-size neighborhoods for the bin packing problem with conflicts. CoRR abs/1705.08495 (2017) - 2016
- [j13]Rafaelli de C. Coutinho, Yuri Frota, Kary A. C. S. Ocaña, Daniel de Oliveira, Lúcia M. A. Drummond:
A Dynamic Cloud Dimensioning Approach for Parallel Scientific Workflows: a Case Study in the Comparative Genomics Domain. J. Grid Comput. 14(3): 443-461 (2016) - [i5]Mario Levorato, Yuri Frota:
Brazilian Congress structural balance analysis. CoRR abs/1609.00767 (2016) - 2015
- [j12]Rafaelli de C. Coutinho, Lúcia M. A. Drummond, Yuri Frota, Daniel de Oliveira:
Optimizing virtual machine allocation for parallel scientific workflows in federated clouds. Future Gener. Comput. Syst. 46: 51-68 (2015) - [c8]Ubiratam de Paula Junior, Lúcia M. A. Drummond, Daniel de Oliveira, Yuri Frota, Valmir Carneiro Barbosa:
Handling flash-crowd events to improve the performance of web applications. SAC 2015: 769-774 - [c7]Mario Levorato, Lúcia M. A. Drummond, Yuri Frota, Rosa Maria Videira de Figueiredo:
An ILS algorithm to evaluate structural balance in signed social networks. SAC 2015: 1117-1122 - [i4]Ubiratam de Paula Junior, Daniel de Oliveira, Yuri Frota, Valmir Carneiro Barbosa, Lúcia M. A. Drummond:
Detecting and Handling Flash-Crowd Events on Cloud Environments. CoRR abs/1510.03913 (2015) - 2014
- [j11]Laura Bahiense, Yuri Frota, Thiago F. Noronha, Celso C. Ribeiro:
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives. Discret. Appl. Math. 164: 34-46 (2014) - [j10]Rosa Maria Videira de Figueiredo, Yuri Frota:
The maximum balanced subgraph of a signed graph: Applications and solution approaches. Eur. J. Oper. Res. 236(2): 473-487 (2014) - [j9]Rafaelli de C. Coutinho, Lúcia M. A. Drummond, Yuri Frota:
A distributed transportation simplex applied to a Content Distribution Network problem. RAIRO Oper. Res. 48(2): 189-210 (2014) - [j8]Breno Piva, Cid C. de Souza, Yuri Frota, Luidi Simonetti:
Integer programming approaches for minimum stabbing problems. RAIRO Oper. Res. 48(2): 211-233 (2014) - [c6]Rafaelli de C. Coutinho, Lúcia M. A. Drummond, Yuri Frota, Daniel de Oliveira, Kary A. C. S. Ocaña:
Evaluating Grasp-based cloud dimensioning for comparative genomics: A practical approach. CLUSTER 2014: 371-379 - [i3]Ubiratam de Paula Junior, Lúcia M. A. Drummond, Daniel de Oliveira, Yuri Frota, Valmir Carneiro Barbosa:
Handling Flash-Crowd Events to Improve the Performance of Web Applications. CoRR abs/1410.2834 (2014) - 2013
- [c5]Rafaelli de C. Coutinho, Lúcia M. A. Drummond, Yuri Frota:
Optimization of a Cloud Resource Management Problem from a Consumer Perspective. Euro-Par Workshops 2013: 218-227 - [c4]Rosa M. V. Figueiredo, Yuri Frota, Martine Labbé:
Solution of the Maximum $$k$$ k -Balanced Subgraph Problem. LION 2013: 266-271 - [c3]Lúcia M. A. Drummond, Rosa M. V. Figueiredo, Yuri Frota, Mario Levorato:
Efficient Solution of the Correlation Clustering Problem: An Application to Structural Balance. OTM Workshops 2013: 674-683 - [i2]Rosa Maria Videira de Figueiredo, Yuri Frota:
An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph. CoRR abs/1312.4345 (2013) - 2012
- [i1]Rafaelli de C. Coutinho, Lúcia M. A. Drummond, Yuri Frota:
A Distributed Transportation Simplex Applied to a Content Distribution Network Problem. CoRR abs/1210.6384 (2012) - 2011
- [j7]Luidi Simonetti, Yuri Frota, Cid C. de Souza:
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm. Discret. Appl. Math. 159(16): 1901-1914 (2011) - [j6]Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza:
New branch-and-bound algorithms for k-cardinality tree problems. Electron. Notes Discret. Math. 37: 27-32 (2011) - [j5]Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza:
A branch-and-price approach for the partition coloring problem. Oper. Res. Lett. 39(2): 132-137 (2011) - 2010
- [j4]Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro:
A branch-and-cut algorithm for partition coloring. Networks 55(3): 194-204 (2010)
2000 – 2009
- 2009
- [j3]Luidi Simonetti, Yuri Frota, Cid C. de Souza:
Upper and lower bounding procedures for the minimum caterpillar spanning problem. Electron. Notes Discret. Math. 35: 83-88 (2009) - [j2]Laura Bahiense, Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro:
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives. Electron. Notes Discret. Math. 35: 347-352 (2009) - [c2]Luidi Simonetti, Yuri Frota, Cid C. de Souza:
An Exact Method for the Minimum Caterpillar Spanning Problem. CTW 2009: 48-51 - [c1]Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza:
A Branch-and-Price Approach for the Partition Coloring Problem. CTW 2009: 187-190 - 2004
- [j1]Manoel B. Campêlo, Ricardo C. Corrêa, Yuri Frota:
Cliques, holes and the vertex coloring polytope. Inf. Process. Lett. 89(4): 159-164 (2004)
Coauthor Index
aka: Lúcia Maria de A. Drummond
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
