Rafael Andrade

Publication Activity (10 Years)

Years Active: 2004-2021
Publications (10 Years): 16

Top Topics

Traveling Salesman

Top Venues

Electron. Notes Discret. Math.

Comput. Oper. Res.

Publications

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)
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 (2020)
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
Improved solution strategies for dominating trees. Expert Syst. Appl. 100 (2018)
Rafael Andrade, Jefferson Gurguri
Models and cutting-plane strategies for the tree-star problem. Electron. Notes Discret. Math. 69 (2018)
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
On a Traveling Salesman based Bilevel Programming Problem. ICORES (2017)
Pablo Adasme, Rafael Andrade, Abdel Lisser
Minimum cost dominating tree sensor networks under probabilistic constraints. Comput. Networks 112 (2017)
Fabio C. S. Dias, Manoel B. Campêlo, Críston P. de Souza, Rafael Andrade
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations. Comput. Oper. Res. 84 (2017)
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. Comput. Oper. Res. 81 (2017)
Rafael Andrade, Tibérius O. Bonates, Manoel B. Campêlo, Mardson Ferreira
Minimum Linear Arrangements. Electron. Notes Discret. Math. 62 (2017)
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
Models for minimum cost dominating trees. Electron. Notes Discret. Math. 52 (2016)
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. ISCO (2016)
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem. ICORES (2016)
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 (2016)
Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser
Stochastic maximum weight forest problem. Networks 65 (4) (2015)
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)
Pablo Adasme, Rafael Andrade, Abdel Lisser
Probabilistic constrained dominating trees. CTW (2015)
Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser
A polynomial formulation for the stochastic maximum weight forest problem. Electron. Notes Discret. Math. 41 (2013)
Rafael Andrade, Abdel Lisser, Nelson Maculan
Multi-service multi-facility network design under uncertainty. Ann. Oper. Res. 199 (1) (2012)
Rafael Andrade, Abilio Lucena, Nelson Maculan
Using Lagrangian dual information to generate degree constrained spanning trees. Discret. Appl. Math. 154 (5) (2006)
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models. Manag. Sci. 52 (9) (2006)
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty. Ann. Oper. Res. 140 (1) (2005)
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau
Telecommunication Network Capacity Design for Uncertain Demand. Comput. Optim. Appl. 29 (2) (2004)