1. In 'Computational Experience with Lenstra's Algorithm' by L Gao, Y Zhang it is claimed that they have an implementation of Lenstra's fixed dimension integer programming algorithm. Is this available online anywhere?
2. Is Barvinok's algorithm available online?



On software for ILP
This may be of some help:



> 
> De Loera, Jesús A., David Haws, Raymond Hemmecke, Peter Huggins, and Ruriko Yoshida. "A computational study of integer programming algorithms based on Barvinok's rational functions." *Discrete Optimization* 2, no. 2 (2005): 135-144.
>  ([Elsevier link](https://www.sciencedirect.com/science/article/pii/S1572528605000198).)
> 
> 
> 


For their comparisons, they used the [CPLEX MIP solver](https://www.ibm.com/support/knowledgecenter/SSSA5P_12.6.0/ilog.odms.cplex.help/CPLEX/UsrMan/topics/discr_optim/mip/01_mip_title_synopsis.html),
and the software package `LattE`
available at <https://www.math.ucdavis.edu/~latte/software.php>.


