[Cgc] ssp solver

[Rolf Steenge]

Hi,
 
Is there an implementation of SSP minimum cost flow solver for acyclic
networks?
 
In the "Network Flows" book (Ahuja, Magnati, Orlin) on page 107 an O(#arcs)
shortest path algorithm for acyclic networks is described and probably this
will improve the performance of the SSP solver for this type of network. I
would like to use the SPP solver in a Lagrangian relaxation and performance
is quite important.
 
Regards
Rolf Steenge
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/cgc/attachments/20070916/b9693a91/attachment.html