Professor Rafael Castro de Andrade
Universidade Federal do Ceara
Professor, Computer Science
Brazil
My co-authors include
Professor Abdel Lisser
My Publications
Improved solution strategies for dominating trees
Expert Systems with Applications
June 2018
MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest p...
Annals of Operations Research
December 2017
Minimum Linear Arrangements
Electronic Notes in Discrete Mathematics
November 2017
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals:...
Computers & Operations Research
August 2017
A linear programming based heuristic framework for min-max regret combinatorial optimiz...
Computers & Operations Research
May 2017
On a Traveling Salesman based Bilevel Programming Problem
January 2017
Minimum cost dominating tree sensor networks under probabilistic constraints
Computer Networks
January 2017
New formulations for the elementary shortest-path problem visiting a given set of nodes
European Journal of Operational Research
November 2016
Models for minimum cost dominating trees
Electronic Notes in Discrete Mathematics
June 2016
On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 ...
January 2016
Trees and Forests
January 2016
A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem
January 2016
Stochastic maximum weight forests
Networks
March 2015
A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body...
January 2015
A polynomial formulation for the stochastic maximum weight forest problem
Electronic Notes in Discrete Mathematics
June 2013
Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem ...
Electronic Notes in Discrete Mathematics
June 2013
Multi-service multi-facility network design under uncertainty
Annals of Operations Research
October 2011
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-...
Management Science
September 2006
Using Lagrangian dual information to generate degree constrained spanning trees
Discrete Applied Mathematics
April 2006
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Unde...
Annals of Operations Research
November 2005
Telecommunication Network Capacity Design for Uncertain Demand
Computational Optimization and Applications
November 2004