default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMariá Cristina Vasconcelos Nascimento
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j31]Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento
:
A hybrid adaptive iterated local search heuristic for the maximal covering location problem. Int. Trans. Oper. Res. 32(1): 176-193 (2025)- [i7]Leonardo Kanashiro Felizardo, Edoardo Fadda, Paolo Brandimarte, Emilio Del-Moral-Hernandez, Mariá Cristina Vasconcelos Nascimento:
A Reinforcement Learning Method for Environments with Stochastic Variables: Post-Decision Proximal Policy Optimization with Dual Critic Networks. CoRR abs/2504.05150 (2025) - 2024
- [j30]Marlon Jeske, Brunilde Sansò, Daniel Aloise, Mariá C. V. Nascimento:
Received Signal Strength Indicator Prediction for Mesh Networks in a Real Urban Environment Using Machine Learning. IEEE Access 12: 165861-165877 (2024) - [j29]Calvin Rodrigues da Costa, Mariá Cristina Vasconcelos Nascimento:
The priority-based traveling backpacker problem: Formulations and heuristics. Expert Syst. Appl. 238(Part A): 121818 (2024) - [j28]Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento:
AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-Scale Capacitated Vehicle Routing Problem. INFORMS J. Comput. 36(4): 974-986 (2024) - 2022
- [j27]Marco Aurélio Sernagiotto, Valério Rosset, Mariá C. V. Nascimento:
A novel multi-objective approach for link selection in aeronautical telecommunication networks. Ann. Oper. Res. 319(2): 1-31 (2022) - [j26]Rodrigo Francisquini, Ana Carolina Lorena, Mariá C. V. Nascimento:
Community-based anomaly detection using spectral graph filtering. Appl. Soft Comput. 118: 108489 (2022) - [j25]Dalton Garcia Borges de Souza, Mariá C. V. Nascimento:
COVID-19 ICU demand forecasting: A two-stage Prophet-LSTM approach. Appl. Soft Comput. 125: 109181 (2022) - [j24]Vinícius R. Máximo, Jean-François Cordeau, Mariá C. V. Nascimento:
An adaptive iterated local search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. Comput. Oper. Res. 148: 105954 (2022) - [j23]Desiree Maldonado Carvalho, Mariá C. V. Nascimento:
Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup. Eur. J. Oper. Res. 296(1): 158-173 (2022) - [j22]Aura Maria Jalal, Eli A. V. Toso, Camila P. S. Tautenhain, Mariá C. V. Nascimento:
An integrated location-transportation problem under value-added tax issues in pharmaceutical distribution planning. Expert Syst. Appl. 206: 117780 (2022) - [i6]Rodrigo Francisquini, Ana Carolina Lorena, Mariá C. V. Nascimento:
Community-based anomaly detection using spectral graph filtering. CoRR abs/2201.09936 (2022) - 2021
- [j21]Camila P. S. Tautenhain, Ana Paula F. D. Barbosa-Póvoa, Bruna Mota, Mariá C. V. Nascimento:
An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem. Eur. J. Oper. Res. 294(1): 70-90 (2021) - [j20]Vinícius R. Máximo, Mariá C. V. Nascimento:
A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem. Eur. J. Oper. Res. 294(3): 1108-1119 (2021) - [j19]Tiago Tiburcio da Silva, Rodrigo Francisquini, Mariá C. V. Nascimento:
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. Expert Syst. Appl. 182: 115190 (2021) - [c14]Rodrigo Francisquini, Tiago Tiburcio da Silva, Mariá C. V. Nascimento:
Detecting Anomalies In Daily COVID-19 Cases Data From Brazil Capitals Using GSP Theory. CEC 2021: 1296-1303 - [c13]Calvin Rodrigues da Costa, Mariá C. V. Nascimento:
Intelligent-Guided Adaptive Search For The Traveling Backpacker Problem. CEC 2021: 2362-2369 - [i5]Desiree Maldonado Carvalho, Mariá C. V. Nascimento:
Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup. CoRR abs/2101.04677 (2021) - [i4]Tiago Tiburcio da Silva, Rodrigo Francisquini, Mariá C. V. Nascimento:
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. CoRR abs/2105.04072 (2021) - 2020
- [j18]Marlon Jeske, Valério Rosset, Mariá C. V. Nascimento:
Determining the trade-offs between data delivery and energy consumption in large-scale WSNs by multi-objective evolutionary optimization. Comput. Networks 179: 107347 (2020) - [j17]Camila P. S. Tautenhain, Mariá C. V. Nascimento:
An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering. Expert Syst. Appl. 141 (2020) - [c12]Camila P. S. Tautenhain, Calvin Rodrigues da Costa, Mariá C. V. Nascimento:
Improved Multilevel Algorithm to Detect Communities in Flight Networks. BRACIS (2) 2020: 573-587
2010 – 2019
- 2019
- [j16]Camila P. S. Tautenhain, Ana Paula F. D. Barbosa-Póvoa, Mariá C. V. Nascimento:
A multi-objective matheuristic for designing and planning sustainable supply chains. Comput. Ind. Eng. 135: 1203-1223 (2019) - [j15]Vinícius R. Máximo, Mariá C. V. Nascimento:
Intensification, learning and diversification in a hybrid metaheuristic: an efficient unification. J. Heuristics 25(4-5): 539-564 (2019) - [c11]Camila P. S. Tautenhain, Mariá C. V. Nascimento:
Spectral Algorithm for Line Graphs to Find Overlapping Communities in Social Networks. ICAART (2) 2019: 306-317 - [i3]Camila P. S. Tautenhain, Rodrigo Francisquini, Mariá C. V. Nascimento:
An analysis of community structure in Brazilian political topic-based Twitter networks. CoRR abs/1906.06315 (2019) - [i2]Camila P. S. Tautenhain, Ana Paula F. D. Barbosa-Póvoa, Bruna Mota, Mariá C. V. Nascimento:
An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem. CoRR abs/1906.06375 (2019) - 2018
- [j14]Desiree Maldonado Carvalho, Mariá C. V. Nascimento:
A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over. Comput. Oper. Res. 100: 43-53 (2018) - [j13]Kátia Y. Nakamura, Leandro C. Coelho, Jacques Renaud, Mariá C. V. Nascimento:
The Traveling Backpacker Problem: A computational comparison of two formulations. J. Oper. Res. Soc. 69(1): 108-114 (2018) - [c10]Rodrigo Francisquini, Mariá C. V. Nascimento, Márcio P. Basgalupp:
NGA-LP: A Robust and Improved Genetic Algorithm to Detect Communities in Directed Networks. CEC 2018: 1-8 - [r1]Mariá C. V. Nascimento, Horacio Hideki Yanasse, Desiree Maldonado Carvalho:
The Multi-plant Lot Sizing Problem with Multiple Periods and Items. Handbook of Heuristics 2018: 1291-1306 - [i1]Camila P. S. Tautenhain, Mariá C. V. Nascimento:
An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering. CoRR abs/1810.03652 (2018) - 2017
- [j12]Vinícius R. Máximo, Mariá C. V. Nascimento, André C. P. L. F. de Carvalho:
Intelligent-guided adaptive search for the maximum covering location problem. Comput. Oper. Res. 78: 129-137 (2017) - [j11]Rodrigo Francisquini, Valério Rosset, Mariá C. V. Nascimento:
GA-LP: A genetic algorithm based on Label Propagation to detect communities in directed networks. Expert Syst. Appl. 74: 127-138 (2017) - [j10]Valério Rosset, Matheus A. De Paulo, Juliana Garcia Cespedes, Mariá C. V. Nascimento:
Enhancing the reliability on data delivery and energy efficiency by combining swarm intelligence and community detection in large-scale WSNs. Expert Syst. Appl. 78: 89-102 (2017) - 2016
- [j9]Desiree Maldonado Carvalho, Mariá C. V. Nascimento:
Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items. Comput. Oper. Res. 71: 137-148 (2016) - [j8]Camila Pereira Santos, Desiree Maldonado Carvalho, Mariá C. V. Nascimento:
A consensus graph clustering algorithm for directed networks. Expert Syst. Appl. 54: 121-135 (2016) - [c9]Vinícius R. Máximo, Mariá C. V. Nascimento, Fabricio A. Breve, Marcos G. Quiles:
Active Consensus-Based Semi-supervised Growing Neural Gas. ICONIP (2) 2016: 126-135 - [c8]Stefano B. B. R. P. Mathias, Valério Rosset, Mariá C. V. Nascimento:
Community Detection by Consensus Genetic-based Algorithm for Directed Networks. KES 2016: 90-99 - [c7]Camila Pereira Santos, Mariá C. V. Nascimento:
Growing Neural Gas as a Memory Mechanism of a Heuristic to Solve a Community Detection Problem in Networks. KES 2016: 485-494 - [c6]Matheus A. De Paulo, Mariá C. V. Nascimento, Valério Rosset:
Improving the Connectivity of Community Detection-based Hierarchical Routing Protocols in Large-scale WSNs. KES 2016: 521-530 - 2014
- [j7]Mariá C. V. Nascimento:
Community detection in networks via a spectral heuristic based on the clustering coefficient. Discret. Appl. Math. 176: 89-99 (2014) - [c5]Desiree Maldonado Carvalho, Hugo Resende, Mariá C. V. Nascimento:
Modularity Maximization Adjusted by Neural Networks. ICONIP (1) 2014: 287-294 - [c4]Vinícius R. Máximo, Marcos G. Quiles, Mariá C. V. Nascimento:
A consensus-based semi-supervised growing neural gas. IJCNN 2014: 2019-2026 - [c3]Matheus A. De Paulo, Mariá C. V. Nascimento, Valério Rosset:
RLP: A Community Detection-Based Routing Protocol for Wireless Sensor Networks. NCA 2014: 237-244 - 2013
- [j6]Mariá Cristina Vasconcelos Nascimento, Leonidas S. Pitsoulis:
Community detection by modularity maximization using GRASP with path relinking. Comput. Oper. Res. 40(12): 3121-3131 (2013) - 2012
- [c2]Mariá Cristina Vasconcelos Nascimento, Franklina Maria Bragion Toledo, André Carlos Ponce de Leon Ferreira de Carvalho:
A hybrid heuristic for the k-medoids clustering problem. GECCO 2012: 417-424 - 2011
- [j5]Mariá Cristina Vasconcelos Nascimento, André Carlos Ponce de Leon Ferreira de Carvalho:
Spectral methods for graph clustering - A survey. Eur. J. Oper. Res. 211(2): 221-231 (2011) - [j4]Mariá Cristina Vasconcelos Nascimento, André C. P. L. F. de Carvalho:
A graph clustering algorithm based on a clustering coefficient for weighted graphs. J. Braz. Comput. Soc. 17(1): 19-29 (2011) - 2010
- [b1]Mariá Cristina Vasconcelos Nascimento:
Metaheuristics for the graph clustering problem. University of São Paulo, Brazil, 2010 - [j3]Mariá Cristina Vasconcelos Nascimento, Franklina Maria Bragion Toledo, André Carlos Ponce de Leon Ferreira de Carvalho:
Investigation of a new GRASP-based clustering algorithm applied to biological data. Comput. Oper. Res. 37(8): 1381-1388 (2010) - [j2]Mariá Cristina Vasconcelos Nascimento, Mauricio G. C. Resende, Franklina Maria Bragion Toledo:
GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur. J. Oper. Res. 200(3): 747-754 (2010)
2000 – 2009
- 2008
- [j1]Mariá Cristina Vasconcelos Nascimento, Franklina Maria Bragion Toledo:
A Hybrid Heuristic for the Multi-Plant Capacitated Lot Sizing Problem With Setup Carry-Over. J. Braz. Comput. Soc. 14(4): 7-15 (2008) - [c1]Mariá Cristina Vasconcelos Nascimento, Franklina Maria Bragion Toledo, André Carlos Ponce de Leon Ferreira de Carvalho:
Consensus Clustering Using Spectral Theory. ICONIP (1) 2008: 461-468
Coauthor Index
aka: André Carlos Ponce de Leon Ferreira de Carvalho
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 2025-05-22 00:44 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:
