default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElisangela Martins de Sá
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Elisama de Araújo Silva Oliveira, Elizabeth F. Wanner, Elisangela Martins de Sá, Sérgio Ricardo de Souza:
A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs. J. Heuristics 31(1): 16 (2025)- 2024
- [j11]João Luiz Marques de Andrade, Marcone Jamilson Freitas Souza
, Elisangela Martins de Sá, Gustavo Campos Menezes, Sérgio Ricardo de Souza:
Formulations and heuristic for the long-term preventive maintenance order scheduling problem. Comput. Oper. Res. 170: 106781 (2024) - [j10]Guilherme Barbosa de Almeida, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza:
A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems. J. Heuristics 30(3-4): 145-172 (2024) - 2023
- [j9]Fabricio Alves Oliveira, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza:
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation. Comput. Oper. Res. 157: 106252 (2023) - [j8]Nayane Carvalho Freitas, Elisangela Martins de Sá, Sérgio Ricardo de Souza:
A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale. Comput. Oper. Res. 159: 106350 (2023) - 2022
- [j7]Fabricio Alves Oliveira, Elisangela Martins de Sá, Sérgio Ricardo de Souza:
Benders decomposition applied to profit maximizing hub location problem with incomplete hub network. Comput. Oper. Res. 142: 105715 (2022) - 2021
- [j6]Alexandre Frias Faria, Sérgio Ricardo de Souza, Elisangela Martins de Sá:
A mixed-integer linear programming model to solve the Multidimensional Multi-Way Number Partitioning Problem. Comput. Oper. Res. 127: 105133 (2021)
2010 – 2019
- 2019
- [c1]Alexandre Frias Faria, Sérgio Ricardo de Souza, Elisangela Martins de Sá, Carlos Alexandre Silva:
Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem. LAGOS 2019: 437-447 - 2018
- [j5]Elisangela Martins de Sá, Reinaldo Morabito, Ricardo Saraiva de Camargo:
Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput. Oper. Res. 89: 31-50 (2018) - [j4]Elisangela Martins de Sá, Reinaldo Morabito, Ricardo Saraiva de Camargo:
Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements. Expert Syst. Appl. 93: 50-61 (2018) - 2015
- [j3]Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau:
Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur. J. Oper. Res. 246(1): 186-198 (2015) - [j2]Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.:
The Hub Line Location Problem. Transp. Sci. 49(3): 500-518 (2015) - 2013
- [j1]Elisangela Martins de Sá, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.:
An improved Benders decomposition algorithm for the tree of hubs location problem. Eur. J. Oper. Res. 226(2): 185-202 (2013)
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 2025-02-14 02:03 CET 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:
