Is Bellman Ford Algorithm exist in GAMS documentation?
Posted: Tue Dec 20, 2022 2:32 pm
Hi GAMS community,
I was reading some of the codes in GAMS documenations to find out the way it works. I particulary am looking for a simple implemetation of shortest path Bellman Ford algorithem to configure a set of parameters and then use it as an indicies inside the model. Mainly for some constraints with summation over those shoetest paths.
there's one shortest path code available at sroutex.gms https://www.gams.com/latest/gamslib_ml/ ... outex.html, so, I'm wondering whther there is one for Bellman Ford algorithem?
with best regrads,
Mike
I was reading some of the codes in GAMS documenations to find out the way it works. I particulary am looking for a simple implemetation of shortest path Bellman Ford algorithem to configure a set of parameters and then use it as an indicies inside the model. Mainly for some constraints with summation over those shoetest paths.
there's one shortest path code available at sroutex.gms https://www.gams.com/latest/gamslib_ml/ ... outex.html, so, I'm wondering whther there is one for Bellman Ford algorithem?
with best regrads,
Mike