Rafael Andrade

According to our database1, Rafael Andrade authored at least 26 papers between 2004 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics.
Int. Trans. Oper. Res., 2021

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

Trees and Forests.
Proceedings of the Handbook of Heuristics., 2018

Improved solution strategies for dominating trees.
Expert Syst. Appl., 2018

An integer linear programming model for the constrained shortest path tour problem.
Electron. Notes Discret. Math., 2018

Models and cutting-plane strategies for the tree-star problem.
Electron. Notes Discret. Math., 2018

A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Minimum Linear Arrangements.
Electron. Notes Discret. Math., 2017

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

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs.
Comput. Oper. Res., 2017

Minimum cost dominating tree sensor networks under probabilistic constraints.
Comput. Networks, 2017

On a Traveling Salesman based Bilevel Programming Problem.
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017

New formulations for the elementary shortest-path problem visiting a given set of nodes.
Eur. J. Oper. Res., 2016

Models for minimum cost dominating trees.
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.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

Stochastic maximum weight forest problem.
Networks, 2015

A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks.
Proceedings of the ICORES 2015, 2015

Probabilistic constrained dominating trees.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds.
Electron. Notes Discret. Math., 2013

A polynomial formulation for the stochastic maximum weight forest problem.
Electron. Notes Discret. Math., 2013

Multi-service multi-facility network design under uncertainty.
Ann. Oper. Res., 2012

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

Using Lagrangian dual information to generate degree constrained spanning trees.
Discret. Appl. Math., 2006

B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty.
Ann. Oper. Res., 2005

Telecommunication Network Capacity Design for Uncertain Demand.
Comput. Optim. Appl., 2004