astarDDP

Initial Release - 3/29/2008

This program is an implementation of the a* algorithm modified to find the "best" cost/attainment pair for a DDP model.

To run:
make model=<int> Bin=<path>
cd <path>
./astar -cost <float> -attainment <float> -seed $RANDOM