Rafael Andrade
According to our database^{1},
Rafael Andrade
authored at least 26 papers
between 2004 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2021
Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics.
Int. Trans. Oper. Res., 2021
2020
MTZprimaldual model, cuttingplane, and combinatorial branchandbound for shortest paths avoiding negative cycles.
Ann. Oper. Res., 2020
2018
Proceedings of the Handbook of Heuristics., 2018
Expert Syst. Appl., 2018
An integer linear programming model for the constrained shortest path tour problem.
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
Proceedings of the Combinatorial Optimization  5th International Symposium, 2018
2017
Electron. Notes Discret. Math., 2017
Mindegree 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 minmax regret combinatorial optimization problems with interval costs.
Comput. Oper. Res., 2017
Comput. Networks, 2017
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017
2016
New formulations for the elementary shortestpath problem visiting a given set of nodes.
Eur. J. Oper. Res., 2016
Electron. Notes Discret. Math., 2016
On the Finite Optimal Convergence of LogicBased Benders' Decomposition in Solving 01 MinMax Regret Optimization Problems with Interval Costs.
Proceedings of the Combinatorial Optimization  4th International Symposium, 2016
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016
2015
Networks, 2015
A Comparative Study of Networkbased 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
2013
Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNSLagrangian bounds.
Electron. Notes Discret. Math., 2013
Electron. Notes Discret. Math., 2013
2012
Ann. Oper. Res., 2012
2006
Enhancing a BranchandBound Algorithm for TwoStage Stochastic Integer Network DesignBased Models.
Manag. Sci., 2006
Discret. Appl. Math., 2006
2005
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty.
Ann. Oper. Res., 2005
2004
Comput. Optim. Appl., 2004