Projects funded by the NCN
Efficient algorithms for finding optiml tours of a traveling salesman and related problems
2013/11/B/ST6/01748
Keywords:
traveling salesman problem approximation algorithms combinatorial optimization
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
- ST1_14: Discrete mathematics and combinatorics
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: 2
Call: OPUS 6 - announced on 2013-09-16
Amount awarded: 207 240 PLN
Project start date (Y-m-d): 2014-08-12
Project end date (Y-m-d): 2018-08-11
Project duration:: 48 months (the same as in the proposal)
Project status: Project settled