• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Student
Title
Supervisor
Faculty
Educational Programme
Final Grade
Year of Graduation
Maksim Kaledin
Toric Ideals and Groebner Bases in Integer Programming
10
2017
The paper studies the applicability of toric ideal methods in linear integer programming. The review of toric ideals method in integer programming and related Groebner theory is presented. Optimization is processed via reduction of monomial-coded feasible solution to its normal form by elements of the Groebner basis of a toric ideal. Experimental estimates of computational complexity were built for solving knapsack problem, transportation problem and minimum vertex cover problem. It is shown that the execution time is very high, so the Buchberger algorithm is able to solve only limited class of problems of relatively small size. Despite that fact, the empirical study of complexity shows acceptable asymptotic results.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses