An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network.
Ernesto de Queirós Vieira MartinsMário S. RosaPublished in: Oper. Res. (1985)
Keyphrases
- preprocessing
- learning algorithm
- computational complexity
- simulated annealing
- network flow
- dynamic programming
- np hard
- cost function
- k means
- detection algorithm
- tree structure
- optimal solution
- worst case
- neural network
- particle swarm optimization
- path length
- network flow problem
- finding the shortest path
- search space
- segmentation algorithm
- path planning
- directed graph
- undirected graph