R. Andrade

发表

Using Lagrangian dual information to generate degree constrained spanning trees

Abilio Lucena, Nelson Maculan, Rafael Andrade, 2006, Discret. Appl. Math..

Using Lagrangian Dual Information to Generate Degree Constrained Minimum Spanning Trees

N. Maculan, A. Lucena, R. Andrade, 2003 .

A two-stage stochastic programming approach for the traveling salesman problem: 5th International Conference on Operations Research and Enterprise Systems, ICORES 2016

Dominique de Werra, Abdel Lisser, Janny M. Y. Leung, 2016 .

Multi-service multi-facility network design under uncertainty

N. Maculan, R. Andrade, A. Lisser, 2011, Annals of Operations Research.

Minimum cost dominating tree sensor networks under probabilistic constraints

Abdel Lisser, Pablo Adasme, Rafael Andrade, 2017, Comput. Networks.

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

Thiago F. Noronha, Rafael Andrade, Andréa C. Santos, 2016, Comput. Oper. Res..

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

Manoel B. Campêlo, Rafael Andrade, Críston P. de Souza, 2017, Comput. Oper. Res..

Trees and Forests

Christophe Duhamel, Rafael Andrade, Andréa C. Santos, 2018, Handbook of Heuristics.

A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem

Ernando Gomes de Sousa, Andréa C. Santos, Rafael Castro de Andrade, 2018, ISCO.

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

Rafael Castro de Andrade, R. Andrade, 2016, Eur. J. Oper. Res..

Elementary shortest-paths visiting a given set of nodes

R. Andrade, Rafael Castro de Andrade, 2013 .