A faster polynomial algorithm for the unbalanced Hitchcock transportation problem.
Ulrich BrennerPublished in: Oper. Res. Lett. (2008)
Keyphrases
- transportation problem
- preprocessing
- k means
- cost function
- detection algorithm
- dynamic programming
- learning algorithm
- simulated annealing
- fixed charge
- memory efficient
- expectation maximization
- particle swarm optimization
- np hard
- optimal solution
- objective function
- worst case
- segmentation algorithm
- convex hull
- optimization model
- search space