Optimal road matching by relaxation to min-cost network flow.
Hangbin WuShan XuShengke HuangJunhua WangXuan YangChun LiuYunling ZhangPublished in: Int. J. Appl. Earth Obs. Geoinformation (2022)
Keyphrases
- network flow
- min cost
- minimum cost
- max flow
- integer programming
- linear programming
- optimization model
- np hard
- dynamic programming
- combinatorial optimization problems
- network flow formulation
- shape matching
- approximation algorithms
- special case
- optimal solution
- worst case
- lagrangian relaxation
- integer program
- search space