Restricted dynamic programming heuristic for precedence constrained bottleneck generalized TSP

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)
Original languageEnglish
Title of host publicationCEUR Workshop Proceedings
PublisherCEUR-WS
Pages85-108
Number of pages24
Volume1513
Publication statusPublished - 2015
Event1st Ural Workshop on Parallel, Distributed, and Cloud Computing for Young Scientists, Ural-PDC 2015 - УрФУ, Екатеринбург, Russian Federation
Duration: 17 Nov 201517 Nov 2015

Conference

Conference1st Ural Workshop on Parallel, Distributed, and Cloud Computing for Young Scientists, Ural-PDC 2015
Country/TerritoryRussian Federation
CityЕкатеринбург
Period17/11/201517/11/2015

Keywords

  • Bottleneck traveling salesman
  • Dynamic programming
  • Generalized traveling salesman
  • Precedence constraints
  • Sequential ordering problem
  • Traveling salesman

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Restricted dynamic programming heuristic for precedence constrained bottleneck generalized TSP'. Together they form a unique fingerprint.

Cite this