Rafael Andrade

According to our database, Rafael Andrade authored at least 32 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Valid inequalities for the k-Color Shortest Path Problem.

Rafael Castro de Andrade, Emanuel Elias Silva Castelo, Rommel Dias Saraiva

Eur. J. Oper. Res., 2024

Crystal Trees.

Rafael Castro de Andrade

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

A flow-based formulation for the multi-sink clustered WSN.

Thiago G. Araujo, Rafael Castro de Andrade, Andréa Cynthia Santos

Proceedings of the 10th International Conference on Control, 2024

2023

Minimum weight clustered dominating tree problem.

Pablo Adasme, Rafael Castro de Andrade

Eur. J. Oper. Res., 2023

2022

A compact quadratic model and linearizations for the minimum linear arrangement problem.

Rafael Castro de Andrade, Tibérius de Oliveira e Bonates, Manoel B. Campêlo, Mardson da Silva Ferreira

Discret. Appl. Math., 2022

2021

Improving logic-based Benders' algorithms for solving min-max regret problems.

Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade

Oper. Res. Decis., 2021

Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics.

Rommel Dias Saraiva, Rafael Castro de Andrade

Int. Trans. Oper. Res., 2021

2020

MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles.

Rafael Castro de Andrade, Rommel Dias Saraiva

Ann. Oper. Res., 2020

2018

Trees and Forests.

Andréa Cynthia Santos, Christophe Duhamel, Rafael Andrade

Proceedings of the Handbook of Heuristics., 2018

Improved solution strategies for dominating trees.

Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser

Expert Syst. Appl., 2018

An integer linear programming model for the constrained shortest path tour problem.

Rafael Castro de Andrade, Rommel Dias Saraiva

Electron. Notes Discret. Math., 2018

Models and cutting-plane strategies for the tree-star problem.

Rafael Andrade, Jefferson Gurguri

Electron. Notes Discret. Math., 2018

A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem.

Ernando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

Minimum Linear Arrangements.

Rafael Andrade, Tibérius O. Bonates, Manoel B. Campêlo, Mardson Ferreira

Electron. Notes Discret. Math., 2017

Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: Complexity, properties and formulations.

Fabio C. S. Dias, Manoel B. Campêlo, Críston P. de Souza, Rafael Andrade

Comput. Oper. Res., 2017

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs.

Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade

Comput. Oper. Res., 2017

Minimum cost dominating tree sensor networks under probabilistic constraints.

Pablo Adasme, Rafael Andrade, Abdel Lisser

Comput. Networks, 2017

On a Traveling Salesman based Bilevel Programming Problem.

Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser

Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017

2016

New formulations for the elementary shortest-path problem visiting a given set of nodes.

Rafael Castro de Andrade

Eur. J. Oper. Res., 2016

Models for minimum cost dominating trees.

Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser

Electron. Notes Discret. Math., 2016

On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs.

Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem.

Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser

Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

2015

Stochastic maximum weight forest problem.

Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser

Networks, 2015

A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks.

Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser

Proceedings of the ICORES 2015, 2015

Probabilistic constrained dominating trees.

Pablo Adasme, Rafael Andrade, Abdel Lisser

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013

Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds.

Rafael Castro de Andrade, Adriano Tavares de Freitas

Electron. Notes Discret. Math., 2013

A polynomial formulation for the stochastic maximum weight forest problem.

Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser

Electron. Notes Discret. Math., 2013

2012

Multi-service multi-facility network design under uncertainty.

Rafael Andrade, Abdel Lisser, Nelson Maculan

Ann. Oper. Res., 2012

2006

Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models.

Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau

Manag. Sci., 2006

Using Lagrangian dual information to generate degree constrained spanning trees.

Rafael Andrade, Abilio Lucena, Nelson Maculan

Discret. Appl. Math., 2006

2005

B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty.

Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau

Ann. Oper. Res., 2005

2004

Telecommunication Network Capacity Design for Uncertain Demand.

Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau

Comput. Optim. Appl., 2004