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

HARA, Takanori und 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 Januar 2023. Vol. 31, no. 1, . DOI 10.1007/s10922-022-09715-y.

Hara, T., und 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, Bd. 31, Nr. 1, Januar 2023, https://doi.org/10.1007/s10922-022-09715-y.

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,

Hara, T. und 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, verfügbar unter:https://doi.org/10.1007/s10922-022-09715-y.