Projects funded by the NCN
Combinatorial optimization through the lens of the traveling salesman route and matchings
2018/29/B/ST6/02633
Keywords:
combinatorial optimization the traveling salesman problem matchings algorithms approximation algorithms graph algorithms
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Wrocławski, Wydział Matematyki i Informatyki
woj. dolnośląskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 5
Call: OPUS 15 - announced on 2018-03-15
Amount awarded: 588 000 PLN
Project start date (Y-m-d): 2019-01-31
Project end date (Y-m-d): 2024-09-29
Project duration:: 36 months (the same as in the proposal)
Project status: Project completed
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.