An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems.
Jianzhong ZhangZhenhong LiuPublished in: Optim. Methods Softw. (2002)
Keyphrases
- strongly polynomial
- minimum cost flow
- preprocessing
- benchmark problems
- optimization algorithm
- optimal solution
- np hard
- dynamic programming
- learning algorithm
- test problems
- computational complexity
- particle swarm optimization
- shortest path problem
- linear program
- image segmentation
- evolutionary algorithm
- routing algorithm
- solution quality
- oracle database
- ant colony optimization
- detection algorithm
- expectation maximization
- optimization problems
- upper bound