Rafael Castro de Andrade
Título
Citado por
Citado por
Ano
Using Lagrangian dual information to generate degree constrained spanning trees
R Andrade, A Lucena, N Maculan
Discrete Applied Mathematics 154 (5), 703-717, 2006
442006
Telecommunication network capacity design for uncertain demand
R Andrade, A Lisser, N Maculan, G Plateau
Computational Optimization and Applications 29 (2), 127-146, 2004
322004
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 (1), 49-65, 2005
202005
Stochastic maximum weight forest problem
P Adasme, R Andrade, M Letournel, A Lisser
Networks 65 (4), 289-305, 2015
142015
Biological and environmental factors associated with risk of schistosomiasis mansoni transmission in Porto de Galinhas, Pernambuco State, Brazil
OB Leal Neto, ECS Gomes, FJM Oliveira Junior, R Andrade, DL Reis, ...
Cadernos de Saúde Pública 29, 357-367, 2013
142013
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
132006
Minimum cost dominating tree sensor networks under probabilistic constraints
P Adasme, R Andrade, A Lisser
Computer Networks 112, 208-222, 2017
122017
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
122016
Elementary shortest-paths visiting a given set of nodes
RC de Andrade
Simpósio Brasileiro de Pesquisa Operacional, 16-19, 2013
102013
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
’Andrea
J Barlow, JM Silveira, LAM Mestre, RB Andrade, D Camacho
G., Louzada, J., Vaz-de-Mello, FZ, Numata, I., Lacau, Sb, Cochrane, MA, 2012
72012
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
62018
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
62017
Improved solution strategies for dominating trees
P Adasme, R Andrade, J Leung, A Lisser
Expert Systems with Applications 100, 30-40, 2018
52018
Multi-service multi-facility network design under uncertainty
R Andrade, A Lisser, N Maculan
Annals of Operations Research 199 (1), 157-178, 2012
52012
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
42017
Appointments on the spanning tree polytope
RC de Andrade
42014
Models for minimum cost dominating trees.
P Adasme, R Andrade, J Leung, A Lisser
Electron. Notes Discret. Math. 52, 101-107, 2016
32016
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
International Symposium on Combinatorial Optimization, 1-12, 2016
32016
A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks.
P Adasme, R Andrade, J Leung, A Lisser
ICORES, 125-132, 2015
32015
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20