Options
Degree-bounded generalized polymatroids and approximating the metric many-visits TSP
Citation Link: https://doi.org/10.15480/882.4143
Publikationstyp
Preprint
Date Issued
2019
Sprache
English
Institut
TORE-DOI
TORE-URI
Subjects
generalized polymatroids
degree constraints
traveling salesman problem
DDC Class
510: Mathematik
More Funding Information
Kristóf was supported by the János Bolyai Research Fellowship of the Hungarian Academy of Sciences and by the UNKP-19-4 New National Excellence Program of the Ministry for Innovation and Technology. Project no. NKFI-128673 has been implemented with the
support provided from the National Research, Development and Innovation Fund of Hungary, financed under the FK 18 funding scheme. This research was supported by Thematic Excellence Programme, Industry and Digitization Subprogramme, NRDI Office, 2019.
support provided from the National Research, Development and Innovation Fund of Hungary, financed under the FK 18 funding scheme. This research was supported by Thematic Excellence Programme, Industry and Digitization Subprogramme, NRDI Office, 2019.
Loading...
Name
1911.09890.pdf
Size
525.36 KB
Format
Adobe PDF