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. The Algorithms are The Conti-Traverso Algorithm and the Original Conti-Traverso Algorithm. Examples are given as well as proofs that correspond to the algorithms. The latter algorithm is more efficient as well as user friendly. The algorithms are not necessarily the best way to solve and integer programming problem, but they do find the optimal solution if it exists.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Mathematical Sciences

Year dc:date.available

2007

Author dc:creator

• Ginn, Isabella Brooke

Contributors dc:contributor

• Dr. James K. Deveney

• algorithm
• integer programming
• Grobner Basis
• optimal solution
• Physical Sciences and Mathematics

Statement dc:rights

• © The Author

Identifier

https://scholarscompass.vcu.edu/etd/769

OAI identifier oai:identifier

oai:scholarscompass.vcu.edu:etd-1768