Cut and flow formulations for the balanced connected k-partition problem (2020)
Source: Proceedings. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME
Assunto: PROGRAMAÇÃO LINEAR
ABNT
MIYAZAWA, Flavio Keidi et al. Cut and flow formulations for the balanced connected k-partition problem. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-53262-8_11. Acesso em: 07 jun. 2024.APA
Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2020). Cut and flow formulations for the balanced connected k-partition problem. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-53262-8_11NLM
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Cut and flow formulations for the balanced connected k-partition problem [Internet]. Proceedings. 2020 ;[citado 2024 jun. 07 ] Available from: https://doi.org/10.1007/978-3-030-53262-8_11Vancouver
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Cut and flow formulations for the balanced connected k-partition problem [Internet]. Proceedings. 2020 ;[citado 2024 jun. 07 ] Available from: https://doi.org/10.1007/978-3-030-53262-8_11