1. Andrade, R. C., Araújo, K. A. G., & Saraiva, R. D. (2015). Um método primal-dual para o problema do caminho mínimo em digrafos na presença de ciclos absorventes. XLVII Simpósio Brasileiro de Pesquisa Operacional (pp. 2904–2911) (in Portuguese).
2. Andrade, R. C., & Freitas, A. T. (2013). Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-lagrangian bounds. Electronic Notes in Discrete Mathematics, 41, 5–12.
3. Batsyn, M., Goldengorin, B., Kocheturov, A., & Pardalos, P. M. (2013). Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem. In B. Goldengorin, V. Kalyagin & P. Pardalos (Eds.), Models, algorithms, and technologies for network analysis. Springer proceedings in mathematics & statistics (Vol. 59, pp. 1–10). New York, NY: Springer.
4. Desrochers, M., & Laporte, G. (1991). Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints. Operations Research Letters, 10(1), 27–36.
5. Drexl, M. (2013). A note on the separation of subtour elimination constraints in elementary shortest path problems. European Journal of Operational Research, 229(3), 595–598.