default search action
Rafael Andrade 0001
Person information
- affiliation: Federal University of Ceará, Fortaleza, Brazil
Other persons with the same name
- Rafael Andrade 0002 — Federal University of Santa Catarina, INCoD, Florianopolis, SC, Brazil
- Rafael Andrade 0003 — Federal University of Paraná, Curitiba, Brazil
- Rafael Andrade 0004 — Universidade Federal de Campina Grande, Pombal, PB, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Rafael Castro de Andrade
, Emanuel Elias Silva Castelo
Valid inequalities for the k-Color Shortest Path Problem. Eur. J. Oper. Res. 315(2): 499-510 (2024) - [c7]Thiago G. Araujo, Rafael Castro de Andrade, Andréa Cynthia Santos:
A flow-based formulation for the multi-sink clustered WSN. CoDIT 2024: 2235-2240 - [c6]Rafael Castro de Andrade
Crystal Trees. ISCO 2024: 163-172 - 2023
- [j22]Pablo Adasme, Rafael Castro de Andrade
Minimum weight clustered dominating tree problem. Eur. J. Oper. Res. 306(2): 535-548 (2023) - 2022
- [j21]Rafael Castro de Andrade
A compact quadratic model and linearizations for the minimum linear arrangement problem. Discret. Appl. Math. 323: 134-148 (2022) - 2021
- [j20]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) - [j19]Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade:
Improving logic-based Benders' algorithms for solving min-max regret problems. Oper. Res. Decis. 31(2) (2021) - 2020
- [j18]Rafael Castro de Andrade
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) - [i3]Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade:
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs. CoRR abs/2001.00943 (2020)
2010 – 2019
- 2018
- [j17]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) - [j16]Rafael Andrade, Jefferson Gurguri:
Models and cutting-plane strategies for the tree-star problem. Electron. Notes Discret. Math. 69: 261-268 (2018) - [j15]Pablo Adasme
Improved solution strategies for dominating trees. Expert Syst. Appl. 100: 30-40 (2018) - [c5]Ernando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos
A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem. ISCO 2018: 133-143 - [r1]Andréa Cynthia Santos
Trees and Forests. Handbook of Heuristics 2018: 1307-1333 - 2017
- [j14]Pablo Adasme
Minimum cost dominating tree sensor networks under probabilistic constraints. Comput. Networks 112: 208-222 (2017) - [j13]Lucas Assunção
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. Comput. Oper. Res. 81: 51-66 (2017) - [j12]Fabio C. S. Dias
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations. Comput. Oper. Res. 84: 46-61 (2017) - [j11]Rafael Andrade, Tibérius O. Bonates, Manoel B. Campêlo
Minimum Linear Arrangements. Electron. Notes Discret. Math. 62: 63-68 (2017) - [c4]Pablo Adasme, Rafael Andrade, Janny Leung
On a Traveling Salesman based Bilevel Programming Problem. ICORES 2017: 329-336 - 2016
- [j10]Pablo Adasme
Models for minimum cost dominating trees. Electron. Notes Discret. Math. 52: 101-107 (2016) - [j9]Rafael Castro de Andrade
New formulations for the elementary shortest-path problem visiting a given set of nodes. Eur. J. Oper. Res. 254(3): 755-768 (2016) - [c3]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem. ICORES 2016: 163-169 - [c2]Lucas Assunção, Andréa Cynthia Santos
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs. ISCO 2016: 1-12 - [i2]Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade:
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. CoRR abs/1609.09179 (2016) - 2015
- [j8]Pablo Adasme
Stochastic maximum weight forest problem. Networks 65(4): 289-305 (2015) - [c1]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks. ICORES 2015: 125-132 - [i1]Pablo Adasme, Rafael Andrade, Abdel Lisser:
Probabilistic constrained dominating trees. CTW 2015: 59-62 - 2013
- [j7]Rafael Castro de Andrade
Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds. Electron. Notes Discret. Math. 41: 5-12 (2013) - [j6]Pablo Adasme
A polynomial formulation for the stochastic maximum weight forest problem. Electron. Notes Discret. Math. 41: 29-36 (2013) - 2012
- [j5]Rafael Andrade
Multi-service multi-facility network design under uncertainty. Ann. Oper. Res. 199(1): 157-178 (2012)
2000 – 2009
- 2006
- [j4]Rafael Andrade
Using Lagrangian dual information to generate degree constrained spanning trees. Discret. Appl. Math. 154(5): 703-717 (2006) - [j3]Rafael Andrade
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models. Manag. Sci. 52(9): 1450-1455 (2006) - 2005
- [j2]Rafael Andrade
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty. Ann. Oper. Res. 140(1): 49-65 (2005) - 2004
- [j1]Rafael Andrade
Telecommunication Network Capacity Design for Uncertain Demand. Comput. Optim. Appl. 29(2): 127-146 (2004)
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-11-13 23:51 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: