Capacitated Shortest Path Tour Problem-Based Integer Linear Programming for Service Chaining and Function Placement in NFV Networks.
Masahiro SasabeTakanori HaraPublished in: IEEE Trans. Netw. Serv. Manag. (2021)
Keyphrases
- shortest path
- integer linear programming
- routing problem
- path length
- shortest path problem
- path selection
- betweenness centrality
- road network
- column generation
- shortest path algorithm
- edge weights
- routing algorithm
- minimum length
- weighted graph
- traveling salesman problem
- travel time
- global constraints
- finding the shortest path
- optimal path
- lot sizing
- small world
- complex networks
- np hard
- shortest distance
- vehicle routing problem
- network structure
- heuristic search
- np complete
- search algorithm
- social networks