Polynomial algorithms for a class of minimum rank-two cost path problems.
Takahito KunoPublished in: J. Glob. Optim. (1999)
Keyphrases
- optimization problems
- benchmark problems
- difficult problems
- data structure
- minimum cost
- test problems
- convex optimization problems
- practical problems
- computational complexity
- run times
- computational problems
- related problems
- combinatorial optimization
- theoretical analysis
- evolutionary algorithm
- benchmark datasets
- shortest path
- computationally efficient
- np complete
- worst case
- approximate solutions
- path finding
- exact algorithms
- theoretical guarantees
- significant improvement
- search space
- polynomial hierarchy