Integer Programming With Groebner Basis
Integer Programming problems are difficult to solve. The goal is to find an optimal solution that minimizes cost. With the help of Groebner based algorithms the optimal solution can be found if it exists. The application of the Groebner based algorithm and how it works is the topic of research....
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
VCU Scholars Compass
2007
|
| Subjects: | |
| Online Access: | http://scholarscompass.vcu.edu/etd/769 http://scholarscompass.vcu.edu/cgi/viewcontent.cgi?article=1768&context=etd |