> Details

Horbach, Andrei [Author]

Combinatorial relaxation of the k-traveling salesman problem

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: E-Book
  • Title: Combinatorial relaxation of the k-traveling salesman problem
  • Contributor: Horbach, Andrei [VerfasserIn]
  • imprint: Kiel: Inst. für Betriebswirtschaftslehre, 2005
    Online-Ausgabe: Kiel; Hamburg: ZBW, 2016
  • Published in: Christian-Albrechts-Universität zu Kiel: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel ; 59900
  • Extent: 9 S; graph. Darst
  • Language: English
  • Identifier:
  • Keywords: Rundreiseproblem ; Theorie ; Matching ; Arbeitspapier ; Graue Literatur
  • Type of reproduction: Online-Ausgabe
  • Place of reproduction: Kiel: ZBW, 2016
  • Origination:
  • Footnote:
  • Description: The k-traveling salesman problem, or k-TSP is: given a graph with edge weights and an integer k, find a simple cycle of minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation and the 1-tree relaxation can be used. We generalize these two relaxations for the k-TSP.
  • Access State: Open Access