default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRommel Dias Saraiva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Rafael Castro de Andrade
, Emanuel Elias Silva Castelo, Rommel Dias Saraiva:
Valid inequalities for the k-Color Shortest Path Problem. Eur. J. Oper. Res. 315(2): 499-510 (2024)- 2021
- [j5]Rommel Dias Saraiva, Rafael Castro de Andrade:
Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics. Int. Trans. Oper. Res. 28(1): 222-261 (2021) - 2020
- [j4]Rafael Castro de Andrade, Rommel Dias Saraiva:
MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles. Ann. Oper. Res. 286(1): 147-172 (2020) - [c5]Rommel Dias Saraiva, Alexandr Grichshenko, Luiz Jonatã Pires de Araújo, Bonfim Amaro Júnior, Guilherme Nepomuceno de Carvalho:
Using Ant Colony Optimisation for map generation and improving game balance in the Terra Mystica and Settlers of Catan board games. FDG 2020: 112:1-112:7 - [c4]Luiz Jonatã Pires de Araújo, Alexandr Grichshenko, Rodrigo Lankaites Pinheiro, Rommel Dias Saraiva, Susanna Gimaeva:
Map Generation and Balance in the Terra Mystica Board Game Using Particle Swarm and Local Search. ICSI 2020: 163-175
2010 – 2019
- 2019
- [j3]Rommel Dias Saraiva, Napoleão Nepomuceno, Plácido Rogério Pinheiro:
A Two-Phase Approach for Single Container Loading with Weakly Heterogeneous Boxes. Algorithms 12(4): 67 (2019) - 2018
- [j2]Rafael Castro de Andrade, Rommel Dias Saraiva:
An integer linear programming model for the constrained shortest path tour problem. Electron. Notes Discret. Math. 69: 141-148 (2018) - 2016
- [j1]Plácido Rogério Pinheiro, Bonfim Amaro Júnior, Rommel Dias Saraiva:
A random-key genetic algorithm for solving the nesting problem. Int. J. Comput. Integr. Manuf. 29(11): 1159-1165 (2016) - 2013
- [c3]B. A. Junior, Plácido Rogério Pinheiro, Rommel Dias Saraiva:
Tackling the Irregular Strip Packing problem by hybridizing genetic algorithm and bottom-left heuristic. IEEE Congress on Evolutionary Computation 2013: 3012-3018 - [c2]Rommel Dias Saraiva, Napoleão Nepomuceno, Plácido Rogério Pinheiro:
The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing. EvoCOP 2013: 262-273 - 2012
- [c1]Rommel Dias Saraiva, Plácido Rogério Pinheiro:
A novel application of crossover operator to a hybrid optimization framework: Investigation into cutting problems. IEEE Congress on Evolutionary Computation 2012: 1-7
Coauthor Index
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:21 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:
