{"id":{"repo_id":"vcu","oai_identifier":"oai:scholarscompass.vcu.edu:etd-1768"},"canonical_url":"https://search.dev.ndltd.org/etd/vcu/oai:scholarscompass.vcu.edu:etd-1768","repository":{"repo_id":"vcu","name":"Virginia Commonwealth University","base_url":"https://scholarscompass.vcu.edu/do/oai/"},"display":{"title":"Integer Programming With Groebner Basis","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Ginn, Isabella Brooke"],"institution":null,"degree_name":"Master of Science","degree_level":"Thesis","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":["Dr. James K. Deveney"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2007,"date_issued":"2007-01-01T08:00:00Z","date_published":"2007-01-01T08:00:00Z","updated_at":"2026-07-24T05:54:21Z","subjects":["algorithm","integer programming","Grobner Basis","optimal solution","Physical Sciences and Mathematics"],"languages":[],"rights":["© The Author"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarscompass.vcu.edu/etd/769"],"render_values":[{"text":"https://scholarscompass.vcu.edu/etd/769","href":"https://scholarscompass.vcu.edu/etd/769","code":true}]}]},"links":{"outbound_url":"https://doi.org/10.25772/DN5T-5M69","outbound_label":"DOI","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. James K. Deveney"]},{"key":"dc:creator","label":"Author","values":["Ginn, Isabella Brooke"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2014-07-09T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["algorithm","integer programming","Grobner Basis","optimal solution","Physical Sciences and Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["© The Author"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://doi.org/10.25772/DN5T-5M69","https://scholarscompass.vcu.edu/etd/769"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Integer Programming With Groebner Basis"]}]}],"canonical_facts":{"dc:contributor":["Dr. James K. Deveney"],"dc:creator":["Ginn, Isabella Brooke"],"dc:date.available":["2014-07-09T07:00:00Z"],"dc:description.abstract":["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."],"dc:identifier":["https://doi.org/10.25772/DN5T-5M69","https://scholarscompass.vcu.edu/etd/769"],"dc:rights":["© The Author"],"dc:subject":["algorithm","integer programming","Grobner Basis","optimal solution","Physical Sciences and Mathematics"],"dc:title":["Integer Programming With Groebner Basis"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science"]},"updated_at":"2026-07-24T05:54:21Z"}