Speedy and Efficient Service Chaining and Function Placement Based on Lagrangian Heuristics for Capacitated Shortest Path Tour Problem.
Takanori HaraMasahiro SasabePublished in: J. Netw. Syst. Manag. (2023)
Keyphrases
- shortest path
- shortest path problem
- routing problem
- road network
- shortest path algorithm
- routing algorithm
- weighted graph
- lagrangian relaxation
- dijkstra algorithm
- finding the shortest path
- np hard
- geodesic distance
- path length
- linear programming
- steiner tree
- optimal path
- facility location
- path selection
- shortest distance
- lower bound