Hara, T., & Sasabe, M. (2023). Speedy and Efficient Service Chaining and Function Placement Based on Lagrangian Heuristics for Capacitated Shortest Path Tour Problem. Journal of Network and Systems Management, 31(1). https://doi.org/10.1007/s10922-022-09715-y
ISO-690 (author-date, English)HARA, Takanori and SASABE, Masahiro, 2023. Speedy and Efficient Service Chaining and Function Placement Based on Lagrangian Heuristics for Capacitated Shortest Path Tour Problem. Journal of Network and Systems Management. 1 January 2023. Vol. 31, no. 1, . DOI 10.1007/s10922-022-09715-y.
Modern Language Association 9th editionHara, T., and M. Sasabe. “Speedy and Efficient Service Chaining and Function Placement Based on Lagrangian Heuristics for Capacitated Shortest Path Tour Problem”. Journal of Network and Systems Management, vol. 31, no. 1, Jan. 2023, https://doi.org/10.1007/s10922-022-09715-y.
Mohr Siebeck - Recht (Deutsch - Österreich)Hara, Takanori/Sasabe, Masahiro: Speedy and Efficient Service Chaining and Function Placement Based on Lagrangian Heuristics for Capacitated Shortest Path Tour Problem, Journal of Network and Systems Management 2023,
Emerald - HarvardHara, T. and Sasabe, M. (2023), “Speedy and Efficient Service Chaining and Function Placement Based on Lagrangian Heuristics for Capacitated Shortest Path Tour Problem”, Journal of Network and Systems Management, Vol. 31 No. 1, available at:https://doi.org/10.1007/s10922-022-09715-y.