default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Andre de Moura Brito
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]José Andre de Moura Brito, Gustavo Silva Semaan
, Augusto Cesar Fadel, Leonardo Silva de Lima, Nelson Maculan:
Mathematical programming formulations for the optimal stratification problem. Commun. Stat. Simul. Comput. 53(6): 2842-2863 (2024)- 2023
- [j10]José Andre de Moura Brito, Gustavo Silva Semaan, Leonardo Silva de Lima, Augusto Cesar Fadel:
Heuristic algorithm for univariate stratification problem. RAIRO Oper. Res. 57(6): 3033-3060 (2023) - 2022
- [j9]José Andre de Moura Brito, Augusto Cesar Fadel, Gustavo Silva Semaan:
A genetic algorithm applied to optimal allocation in stratified sampling. Commun. Stat. Simul. Comput. 51(7): 3714-3732 (2022) - [j8]José Andre de Moura Brito, Gustavo Silva Semaan, Augusto Cesar Fadel:
The effective BRKGA algorithm for the k-medoids clustering problem. RAIRO Oper. Res. 56(4): 3137-3153 (2022) - [i3]Carla Silva Oliveira, Fausto Marques Pinheiro Junior, José Andre de Moura Brito:
Spectral Heuristics Applied to Vertex Reliability. CoRR abs/2211.08514 (2022) - 2021
- [j7]Augusto Pizano Vieira Beltrão, Luiz Satoru Ochi, José Andre de Moura Brito, Gustavo Silva Semaan, Nelson Maculan, Augusto Cesar Fadel:
A new approach for the traveling salesperson problem with hotel selection. EURO J. Transp. Logist. 10: 100062 (2021) - [j6]Augusto Cesar Fadel, Luiz Satoru Ochi, José Andre de Moura Brito, Gustavo Silva Semaan:
Microaggregation heuristic applied to statistical disclosure control. Inf. Sci. 548: 37-55 (2021) - [j5]José Andre de Moura Brito, Leonardo Silva de Lima, Pedro Henrique González, Breno Oliveira, Nelson Maculan:
Heuristic approach applied to the optimum stratification problem. RAIRO Oper. Res. 55(2): 979-996 (2021)
2010 – 2019
- 2017
- [j4]José Andre de Moura Brito, Gustavo Silva Semaan, Augusto Cesar Fadel, Luciana Roque Brito:
An optimization approach applied to the optimal stratification problem. Commun. Stat. Simul. Comput. 46(6): 4419-4451 (2017) - 2016
- [j3]Vinicius Leal do Forte, Flávio Montenegro, José Andre de Moura Brito, Nelson Maculan:
Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions. Int. Trans. Oper. Res. 23(6): 1185-1199 (2016) - 2013
- [i2]José Andre de Moura Brito, Gustavo Silva Semaan, Pedro Luis do Nascimento Silva, Nelson Maculan:
An Integer Programming Formulation Applied to Optimum Allocation in Multivariate Stratified Sampling. CoRR abs/1309.6148 (2013) - 2010
- [j2]José Andre de Moura Brito, Luiz S. Ochi, Flávio Montenegro, Nelson Maculan:
An iterative local search approach applied to the optimal stratification problem. Int. Trans. Oper. Res. 17(6): 753-764 (2010) - [j1]José Andre de Moura Brito, Nelson Maculan, Maurício Lila, Flávio Montenegro:
An exact algorithm for the stratification problem with proportional allocation. Optim. Lett. 4(2): 185-195 (2010)
2000 – 2009
- 2009
- [i1]José Andre de Moura Brito, Maurício Lila, Flávio Montenegro, Nelson Maculan:
An Exact Algorithm for the Stratification Problem with Proportional Allocation. CoRR abs/0902.3223 (2009)
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-05 21:12 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:
