default search action
Alexandre Xavier Martins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j10]Paganini Barcellos de Oliveira
, Ricardo Saraiva de Camargo, Gilberto de Miranda Junior
A computational study of a decomposition approach for the dynamic two-level uncapacitated facility location problem with single and multiple allocation. Comput. Ind. Eng. 151: 106964 (2021)
2010 – 2019
- 2019
- [c4]Matheus de Araujo Butinholi, Alexandre Xavier Martins, Paganini Barcellos de Oliveira
Basic VNS for the Uncapacitated Single Allocation p-Hub Maximal Covering Problem. ICVNS 2019: 126-138 - 2018
- [j9]Josiane da Costa Vieira Rezende, Marcone Jamilson Freitas Souza
HMS: A hybrid multi-start algorithm for solving binary linear programs. Electron. Notes Discret. Math. 66: 7-14 (2018) - [j8]Jean Carlos Tibúrcio Campos, Alexandre Xavier Martins, Marcone J. F. Souza
A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem. Electron. Notes Discret. Math. 66: 159-166 (2018) - [c3]Felipe Novaes Caldas, Alexandre Xavier Martins:
Proposed Solutions to the Tripper Car Positioning Problem. ICEIS (1) 2018: 344-352 - 2017
- [j7]Alexandre Xavier Martins, Christophe Duhamel
A column generation approach for the strong network orientation problem. Electron. Notes Discret. Math. 62: 75-80 (2017) - 2016
- [j6]Christophe Duhamel
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem. 4OR 14(2): 201-220 (2016) - 2013
- [j5]Bruno N. Gomes, Alexandre Xavier Martins, Ricardo Saraiva de Camargo, Jaime A. Ramírez
An Efficient Genetic Algorithm for the Design of Hub-and-Spoke Networks. IEEE Commun. Lett. 17(4): 793-796 (2013) - 2012
- [j4]Alexandre Xavier Martins, Christophe Duhamel
Variable neighborhood descent with iterated local search for routing and wavelength assignment. Comput. Oper. Res. 39(9): 2133-2141 (2012) - [j3]R. C. Cruz, T. C. B. Silva, Marcone J. F. Souza
GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery. Electron. Notes Discret. Math. 39: 217-224 (2012) - [j2]Eduardo Uchoa
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem. Networks 59(1): 148-160 (2012) - [c2]Matheus Nohra Haddad, Igor Machado Coelho, Marcone Jamilson Freitas Souza
GARP: A New Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Setup Times. SCCC 2012: 152-160 - 2011
- [b1]Alexandre Xavier Martins:
Metaheurísticas e Formulações para a resolução do Problema de Roteamento e Alocação de Comprimentos de Onda em Redes Ópticas. (Métaheuristiques et modélisation du problème de routage et affectation de longueurs d'ondes pour les réseaux de communications optiques). Blaise Pascal University, Clermont-Ferrand, France, 2011 - [c1]Alexandre Xavier Martins, Christophe Duhamel
A VND-ILS Heuristic to Solve the RWA Problem. INOC 2011: 577-582
2000 – 2009
- 2009
- [j1]Alexandre Xavier Martins, Maurício C. de Souza
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem. J. Heuristics 15(2): 133-151 (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-10-07 22:18 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: