Follow
Mariá C. V. Nascimento
Mariá C. V. Nascimento
Associate Professor of Computer Science, Federal University of São Paulo
Verified email at unifesp.br - Homepage
Title
Cited by
Cited by
Year
Spectral methods for graph clustering–a survey
MCV Nascimento, AC De Carvalho
European Journal of Operational Research 211 (2), 221-231, 2011
2272011
GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
MCV Nascimento, MGC Resende, FMB Toledo
European Journal of Operational Research 200 (3), 747-754, 2010
922010
Community detection by modularity maximization using GRASP with path relinking
MCV Nascimento, L Pitsoulis
Computers & Operations Research 40 (12), 3121-3131, 2013
652013
Community detection in networks via a spectral heuristic based on the clustering coefficient
MCV Nascimento
Discrete Applied Mathematics 176, 89-99, 2014
502014
Investigation of a new GRASP-based clustering algorithm applied to biological data
MCV Nascimento, FMB Toledo, AC de Carvalho
Computers & Operations Research 37 (8), 1381-1388, 2010
412010
Enhancing the reliability on data delivery and energy efficiency by combining swarm intelligence and community detection in large-scale WSNs
V Rosset, MA Paulo, JG Cespedes, MCV Nascimento
Expert Systems with Applications 78, 89-102, 2017
362017
Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
DM Carvalho, MCV Nascimento
Computers & Operations Research 71, 137-148, 2016
322016
Intelligent-guided adaptive search for the maximum covering location problem
VR Máximo, MCV Nascimento, AC Carvalho
Computers & Operations Research 78, 129-137, 2017
302017
A multi-objective matheuristic for designing and planning sustainable supply chains
CPS Tautenhain, AP Barbosa-Povoa, MCV Nascimento
Computers & Industrial Engineering 135, 1203-1223, 2019
272019
GA-LP: A genetic algorithm based on Label Propagation to detect communities in directed networks
R Francisquini, V Rosset, MCV Nascimento
Expert Systems with Applications 74, 127-138, 2017
232017
A consensus graph clustering algorithm for directed networks
CP Santos, DM Carvalho, MCV Nascimento
Expert Systems with Applications 54, 121-135, 2016
212016
A graph clustering algorithm based on a clustering coefficient for weighted graphs
MCV Nascimento, AC Carvalho
Journal of the Brazilian Computer Society 17 (1), 19-29, 2011
192011
A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over
MCV Nascimento, FMB Toledo
Journal of the Brazilian Computer Society 14 (4), 7-15, 2008
192008
Determining the trade-offs between data delivery and energy consumption in large-scale WSNs by multi-objective evolutionary optimization
M Jeske, V Rosset, MCV Nascimento
Computer Networks 179, 107347, 2020
172020
A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
DM Carvalho, MCV Nascimento
Computers & Operations Research 100, 43-53, 2018
152018
A hybrid adaptive Iterated Local Search with diversification control to the Capacitated Vehicle Routing Problem
VR Máximo, MCV Nascimento
European Journal of Operational Research 294 (3), 1108-1119, 2021
132021
Community detection by consensus genetic-based algorithm for directed networks
SB Mathias, V Rosset, MCV Nascimento
Procedia Computer Science 96, 90-99, 2016
132016
Meteorological and human mobility data on predicting COVID-19 cases by a novel hybrid decomposition method with anomaly detection analysis: a case study in the capitals of Brazil
TT da Silva, R Francisquini, MCV Nascimento
Expert Systems with Applications 182, 115190, 2021
122021
Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
DM Carvalho, MCV Nascimento
European Journal of Operational Research 296 (1), 158-173, 2022
82022
An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering
CPS Tautenhain, MCV Nascimento
Expert Systems with Applications 141, 112911, 2020
82020
The system can't perform the operation now. Try again later.
Articles 1–20