The SAS module SAS\OR has a number of procedures used for optimization of different forms.
I'm too lazy to look up what ever a Bellman Recursion Problem may be. Please post a reference. The OPTNET procedure documentation mentions that a Bellman-Ford algorithm is implemented for a shortest path problem with weighted link values.
April 27 – 30 | Gaylord Texan | Grapevine, Texas
Registration is open
Walk in ready to learn. Walk out ready to deliver. This is the data and AI conference you can't afford to miss. Register now and lock in 2025 pricing—just $495!