Rafael Castro de Andrade

11 papers C 3Journal 8
YearRankTypeTitle / Venue / Authors
2024 C conf
A flow-based formulation for the multi-sink clustered WSN.
CoDIT
Thiago G. Araujo, Rafael Castro de Andrade, Andréa Cynthia Santos
2024 C conf
Crystal Trees.
ISCO
Rafael Castro de Andrade
2024 J jnl
Valid inequalities for the k-Color Shortest Path Problem.
Eur. J. Oper. Res.
Rafael Castro de Andrade, Emanuel Elias Silva Castelo, Rommel Dias Saraiva
2023 J jnl
Minimum weight clustered dominating tree problem.
Eur. J. Oper. Res.
Pablo Adasme, Rafael Castro de Andrade
2022 J jnl
A compact quadratic model and linearizations for the minimum linear arrangement problem.
Discret. Appl. Math.
Rafael Castro de Andrade, Tibérius de Oliveira e Bonates, Manoel B. Campêlo, Mardson da Silva Ferreira
2021 J jnl
Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics.
Int. Trans. Oper. Res.
Rommel Dias Saraiva, Rafael Castro de Andrade
2020 J jnl
MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles.
Ann. Oper. Res.
Rafael Castro de Andrade, Rommel Dias Saraiva
2018 C conf
A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem.
ISCO
Ernando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos
2018 J jnl
An integer linear programming model for the constrained shortest path tour problem.
Electron. Notes Discret. Math.
Rafael Castro de Andrade, Rommel Dias Saraiva
2016 J jnl
New formulations for the elementary shortest-path problem visiting a given set of nodes.
Eur. J. Oper. Res.
Rafael Castro de Andrade
2013 J jnl
Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds.
Electron. Notes Discret. Math.
Rafael Castro de Andrade, Adriano Tavares de Freitas