Telecommunication Network Capacity Design for Uncertain Demand. - Rafael Andrade 001; Abdel Lisser; Nelson Maculan; Gérard Plateau (Comput. Optim. Appl., 2004)

B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty. - Rafael Andrade 001; Abdel Lisser; Nelson Maculan; Gérard Plateau (Ann. Oper. Res., 2005)

Using Lagrangian dual information to generate degree constrained spanning trees. - Rafael Andrade 001; Abilio Lucena; Nelson Maculan (Discret. Appl. Math., 2006)

Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models. - Rafael Andrade 001; Abdel Lisser; Nelson Maculan; Gérard Plateau (Manag. Sci., 2006)

Multi-service multi-facility network design under uncertainty. - Rafael Andrade 001; Abdel Lisser; Nelson Maculan (Ann. Oper. Res., 2012)

A polynomial formulation for the stochastic maximum weight forest problem. - Pablo Adasme; Rafael Andrade 001; Marc Letournel; Abdel Lisser (Electron. Notes Discret. Math., 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)

Probabilistic constrained dominating trees. - Pablo Adasme; Rafael Andrade 001; Abdel Lisser (CTW, 2015)

A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks. - Pablo Adasme; Rafael Andrade 001; Janny Leung; Abdel Lisser (ICORES, 2015)

Stochastic maximum weight forest problem. - Pablo Adasme; Rafael Andrade 001; Marc Letournel; Abdel Lisser (Networks, 2015)

A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem. - Pablo Adasme; Rafael Andrade 001; Janny Leung; Abdel Lisser (ICORES, 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 001 (ISCO, 2016)

Models for minimum cost dominating trees. - Pablo Adasme; Rafael Andrade 001; Janny Leung; Abdel Lisser (Electron. Notes Discret. Math., 2016)

New formulations for the elementary shortest-path problem visiting a given set of nodes. - Rafael Castro de Andrade (Eur. J. Oper. Res., 2016)

On a Traveling Salesman based Bilevel Programming Problem. - Pablo Adasme; Rafael Andrade 001; Janny Leung; Abdel Lisser (ICORES, 2017)

Minimum cost dominating tree sensor networks under probabilistic constraints. - Pablo Adasme; Rafael Andrade 001; Abdel Lisser (Comput. Networks, 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 001 (Comput. Oper. Res., 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 001 (Comput. Oper. Res., 2017)

Minimum Linear Arrangements. - Rafael Andrade 001; Tibérius O. Bonates; Manoel B. Campêlo; Mardson Ferreira (Electron. Notes Discret. Math., 2017)

A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem. - Ernando Gomes de Sousa; Rafael Castro de Andrade; Andréa Cynthia Santos (ISCO, 2018)

Models and cutting-plane strategies for the tree-star problem. - Rafael Andrade 001; Jefferson Gurguri (Electron. Notes Discret. Math., 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)

Improved solution strategies for dominating trees. - Pablo Adasme; Rafael Andrade 001; Janny Leung; Abdel Lisser (Expert Syst. Appl., 2018)

Trees and Forests. - Andréa Cynthia Santos; Christophe Duhamel; Rafael Andrade 001 (Handbook of Heuristics, 2018)

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)

Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics. - Rommel Dias Saraiva; Rafael Castro de Andrade (Int. Trans. Oper. Res., 2021)

Improving logic-based Benders' algorithms for solving min-max regret problems. - Lucas Assunção; Andréa Cynthia Santos; Thiago F. Noronha; Rafael Andrade 001 (Oper. Res. Decis., 2021)

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)

Minimum weight clustered dominating tree problem. - Pablo Adasme; Rafael Castro de Andrade (Eur. J. Oper. Res., 2023)

A flow-based formulation for the multi-sink clustered WSN. - Thiago G. Araujo; Rafael Castro de Andrade; Andréa Cynthia Santos (CoDIT, 2024)

Crystal Trees. - Rafael Castro de Andrade (ISCO, 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)