A fast polynomial time algorithm for logistics network flows.
Suh-Wen ChiouPublished in: Appl. Math. Comput. (2008)
Keyphrases
- network flow
- computational complexity
- cost function
- min cost
- experimental evaluation
- detection algorithm
- high accuracy
- worst case
- search space
- dynamic programming
- learning algorithm
- ant colony optimization
- segmentation algorithm
- linear programming
- computational cost
- significant improvement
- k means
- preprocessing
- neural network
- optimal solution
- convergence rate
- optimization method
- bipartite graph
- polynomial time complexity
- matching algorithm
- expectation maximization
- probabilistic model
- np hard
- evolutionary algorithm