Combinatorial Optimization and Optimal Allocation Problem

Student: Tiunov Aleksandr

Supervisor:

Educational Programme: Data Science (Master)

Final Grade: 8

Year of Graduation: 2019

We consider an NP-hard combinatorial optimization problem, that big online shops with a multiple warehouses may encounter with. A few different approaches are given, which provide computationally efficient and robust solutions.

Full text (added May 22, 2019)

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