Many network optimization algorithms, including shortest path, push-relabel, augmenting path, etc, actually have an interpretation in terms of linear programming.

A famous application of semidefinite programming is the max-cut approximation. Does this optimization algorithm, or any other on networks, have a network interpretation, a la augmenting path?