>>>> INTEGER PROGRAMMING VIA BINOMIAL IDEALS
Integer Programming problems can be solved by calculating a so-called reduced Gröbner Basis (see e.g. http://grobner.nuigalway.ie/). In this case the starting point is a binomial ideal. The algorithms for binomial calculations admit many simplifications. The purpose of the project is to modify standard (Buchberger) algorithms to take advantage of the binomial structure. The project will produce a web page where the user can enter the data for an Integer Program, and receive an optimum solution, if one exists.
This project will be carried out under linux and so requires some knowledge of/interest in linux/unix.