That's not a drop-in replacement for dynamic programming though, is it? Can you do something like edit distance with IP?
Generally, shortest path algorithms rely on dynamic programming for a reasonable solution. Examples of include the Traveling Salesman.