Isabel Rosseti
Orcid: 0000-0001-8560-5313
According to our database1,
Isabel Rosseti
authored at least 30 papers
between 2002 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
J. Inf. Data Manag., October, 2023
2022
J. Inf. Data Manag., 2022
Improving a state-of-the-art heuristic for the minimum latency problem with data mining.
Int. Trans. Oper. Res., 2022
A Provenance-based Execution Strategy for Variant GPU-accelerated Scientific Workflows in Clouds.
J. Grid Comput., 2022
Proceedings of the 37th Brazilian Symposium on Databases, 2022
Proceedings of the Metaheuristics - 14th International Conference, 2022
2021
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy.
RAIRO Oper. Res., 2021
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem.
RAIRO Oper. Res., 2021
RAIRO Oper. Res., 2021
2020
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model.
J. Glob. Optim., 2020
A hybrid data mining heuristic to solve the point-feature cartographic label placement problem.
Int. Trans. Oper. Res., 2020
2019
Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem.
Int. Trans. Oper. Res., 2019
A provenance-based heuristic for preserving results confidentiality in cloud-based scientific workflows.
Future Gener. Comput. Syst., 2019
2018
Proceedings of the Handbook of Heuristics., 2018
Eur. J. Oper. Res., 2018
2017
Proceedings of the 12th Workshop on Workflows in Support of Large-Scale Science, 2017
On tweets, retweets, hashtags and user profiles in the 2016 American Presidential Election Scene.
Proceedings of the 18th Annual International Conference on Digital Government Research, 2017
2016
Extending the hybridization of metaheuristics with data mining: Dealing with sequences.
Intell. Data Anal., 2016
2015
tttplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms.
Optim. Lett., 2015
2014
Proceedings of the ICEIS 2014, 2014
2013
Int. Trans. Oper. Res., 2013
2012
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms.
J. Glob. Optim., 2012
2011
Effective Probabilistic Stopping Rules for Randomized Metaheuristics: GRASP Implementations.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011
2009
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009
2007
Parallel Comput., 2007
Comput. Commun., 2007
2004
Applications and Parallel Implementations of Metaheuristics in Network Design and Routing.
Proceedings of the Applied Computing, Second Asian Applied Computing Conference, 2004
2002
Proceedings of the Euro-Par 2002, 2002