Follow
Rafael Castro de Andrade
Title
Cited by
Cited by
Year
Using Lagrangian dual information to generate degree constrained spanning trees
R Andrade, A Lucena, N Maculan
Discrete Applied Mathematics 154 (5), 703-717, 2006
512006
Telecommunication network capacity design for uncertain demand
R Andrade, A Lisser, N Maculan, G Plateau
Computational Optimization and Applications 29, 127-146, 2004
322004
New formulations for the elementary shortest-path problem visiting a given set of nodes
RC de Andrade
European Journal of Operational Research 254 (3), 755-768, 2016
262016
Minimum cost dominating tree sensor networks under probabilistic constraints
P Adasme, R Andrade, A Lisser
Computer Networks 112, 208-222, 2017
212017
B&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
R Andrade, A Lisser, N Maculan, G Plateau
Annals of Operations Research 140, 49-65, 2005
202005
An integer linear programming model for the constrained shortest path tour problem
RC de Andrade, RD Saraiva
Electronic Notes in Discrete Mathematics 69, 141-148, 2018
192018
Stochastic maximum weight forest problem
P Adasme, R Andrade, M Letournel, A Lisser
Networks 65 (4), 289-305, 2015
162015
Improved solution strategies for dominating trees
P Adasme, R Andrade, J Leung, A Lisser
Expert Systems with Applications 100, 30-40, 2018
152018
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
L Assunção, TF Noronha, AC Santos, R Andrade
Computers & Operations Research 81, 51-66, 2017
152017
Enhancing a Branch-and-Bound algorithm for two-stage stochastic integer network design-based models
R Andrade, A Lisser, N Maculan, G Plateau
Management Science 52 (9), 1450-1455, 2006
142006
Elementary shortest-paths visiting a given set of nodes
RC de Andrade
Simpósio Brasileiro de Pesquisa Operacional, 16-19, 2013
132013
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations
FCS Dias, M Campêlo, C Souza, R Andrade
Computers & Operations Research 84, 46-61, 2017
122017
Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics
RD Saraiva, RC de Andrade
International Transactions in Operational Research 28 (1), 222-261, 2021
92021
A polynomial formulation for the stochastic maximum weight forest problem
P Adasme, R Andrade, M Letournel, A Lisser
Electronic Notes in Discrete Mathematics 41, 29-36, 2013
72013
Minimum linear arrangements
R Andrade, T Bonates, M Campêlo, M Ferreira
Electronic Notes in Discrete Mathematics 62, 63-68, 2017
62017
BB strategies for stochastic integer programming
R Andrade, A Lisser, N Maculan, G Plateau
Special Volume of Annals of OR: State-of-the-Art IP and MIP (Algorithms …, 2005
62005
On the finite optimal convergence of logic-based benders’ decomposition in solving 0–1 min-max regret optimization problems with interval costs
L Assunçao, AC Santos, TF Noronha, R Andrade
Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri …, 2016
52016
Multi-service multi-facility network design under uncertainty
R Andrade, A Lisser, N Maculan
Annals of Operations Research 199, 157-178, 2012
52012
Trees and Forests.
AC Santos, C Duhamel, R Andrade
Handbook of Heuristics, 1307-1333, 2018
42018
Models for minimum cost dominating trees
P Adasme, R Andrade, J Leung, A Lisser
Electronic Notes in Discrete Mathematics 52, 101-107, 2016
42016
The system can't perform the operation now. Try again later.
Articles 1–20