Rafael Andrade

23 papers C 5Journal 17
YearRankTypeTitle / Venue / Authors
2021 J jnl
Improving logic-based Benders' algorithms for solving min-max regret problems.
Oper. Res. Decis.
Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade
2020 J jnl
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs.
CoRR
Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade
2018 J jnl
Improved solution strategies for dominating trees.
Expert Syst. Appl.
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
2018 J jnl
Models and cutting-plane strategies for the tree-star problem.
Electron. Notes Discret. Math.
Rafael Andrade, Jefferson Gurguri
2018 — ch.
Trees and Forests.
Handbook of Heuristics
Andréa Cynthia Santos, Christophe Duhamel, Rafael Andrade
2017 J jnl
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs.
Comput. Oper. Res.
Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade
2017 J jnl
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations.
Comput. Oper. Res.
Fabio C. S. Dias, Manoel B. Campêlo, Críston P. de Souza, Rafael Andrade
2017 J jnl
Minimum Linear Arrangements.
Electron. Notes Discret. Math.
Rafael Andrade, Tibérius O. Bonates, Manoel B. Campêlo, Mardson Ferreira
2017 J jnl
Minimum cost dominating tree sensor networks under probabilistic constraints.
Comput. Networks
Pablo Adasme, Rafael Andrade, Abdel Lisser
2017 C conf
On a Traveling Salesman based Bilevel Programming Problem.
ICORES
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
2016 C conf
A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem.
ICORES
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
2016 J jnl
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs.
CoRR
Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade
2016 J jnl
Models for minimum cost dominating trees.
Electron. Notes Discret. Math.
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
2016 C conf
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs.
ISCO
Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade
2015 C conf
A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks.
ICORES
Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser
2015 C conf
Probabilistic constrained dominating trees.
CTW
Pablo Adasme, Rafael Andrade, Abdel Lisser
2015 J jnl
Stochastic maximum weight forest problem.
Networks
Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser
2013 J jnl
A polynomial formulation for the stochastic maximum weight forest problem.
Electron. Notes Discret. Math.
Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser
2012 J jnl
Multi-service multi-facility network design under uncertainty.
Ann. Oper. Res.
Rafael Andrade, Abdel Lisser, Nelson Maculan
2006 J jnl
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models.
Manag. Sci.
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau
2006 J jnl
Using Lagrangian dual information to generate degree constrained spanning trees.
Discret. Appl. Math.
Rafael Andrade, Abilio Lucena, Nelson Maculan
2005 J jnl
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty.
Ann. Oper. Res.
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau
2004 J jnl
Telecommunication Network Capacity Design for Uncertain Demand.
Comput. Optim. Appl.
Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau