Werbung
 Übersetzung für 'Traveling Salesman problem' von Englisch nach Deutsch
Traveling Salesman problem [Am.] <TSP>Problem {n} des Handlungs­reisenden
Teiltreffer
comm.jobs
traveling salesman [Am.]
Geschäftsreisender {m}
comm.
traveling salesman [Am.]
fliegender Händler {m}
traveling salesman [Am.]Handelsreisender {m}
comp.math.spec.
Travelling Salesman Problem <TSP>
Problem {n} des Handlungs­reisenden
comp.math.spec.
traveling salesperson problem <TSP> [Am.]
Rundreiseproblem {n}
MedTech.
traveling saturation [Am.] <traveling sat>
mitlaufende Sättigung {f} [mitlaufende Sättigungs­schicht]
comp.
year 2000 problem <Y2K problem> [also: Year 2000 Problem]
Jahr-2000-Problem {n}
salesmanGeschäftsmann {m}
62
salesmanVertriebler {m} [ugs.]
34
jobs
salesman
Verkäufer {m}
1056
jobs
salesman
Händler {m}
49
jobs
top salesman
Spitzenverkäufer {m}
automot.comm.jobs
car salesman
Automobilverkäufer {m}
same salesmangleicher Verkäufer {m}
jobs
furniture salesman
Möbelverkäufer {m}
jobs
junior salesman
Anfangsverkäufer {m}
insur.
insurance salesman
Versicherungs­kaufmann {m}
comm.jobs
travelling salesman
Handelsreisender {m}
jobs
book salesman
Bücherverkäufer {m}
comm.
travelling salesman
Reisender {m}
21 Übersetzungen
Neue Wörterbuch-Abfrage: Einfach jetzt tippen!

Anwendungsbeispiele Englisch
  • It is often used when the search space is discrete (for example the traveling salesman problem, the boolean satisfiability problem, protein structure prediction, and job-shop scheduling).
  • Optimization problems arise naturally in many applications, such as the traveling salesman problem and many questions in linear programming.
  • To further highlight the difference between a problem and an instance, consider the following instance of the decision version of the traveling salesman problem: Is there a route of at most 2000 kilometres passing through all of Germany's 15 largest cities?
  • In the traveling salesman problem the goal is to minimize distance traveled.
  • Another well-known NP-equivalent problem is the traveling salesman problem.

  • Hopfield and Tank presented the Hopfield network application in solving the classical traveling-salesman problem in 1985.
  • The case "d" = 2 is a special case of the traveling salesman problem, so the degree constrained minimum spanning tree is NP-hard in general.
  • In the case of the metric traveling salesman problem, the best known inapproximability result rules out algorithms with an approximation ratio less than 123/122 ≈ 1.008196 unless P = NP, Karpinski, Lampis, Schmied.
  • on the traveling salesman problem.
  • The Bottleneck traveling salesman problem (bottleneck TSP) is a problem in discrete or combinatorial optimization.

  • There are also a variety of other problem-specific heuristics, such as the k-opt heuristic for the traveling salesman problem.
  • Such graphs arise in many contexts, for example in shortest path problems such as the traveling salesman problem.
  • For example, for the traveling salesman problem a solution can be a route visiting all cities and the goal is to find the shortest route.
  • For example, for the Euclidean traveling salesman problem, a PTAS would produce a tour with length at most [...] , with [...] being the length of the shortest tour.
Werbung
© dict.cc English-German dictionary 2025
Enthält Übersetzungen von der TU Chemnitz sowie aus Mr Honey's Business Dictionary (nur Englisch/Deutsch).
Links auf das Wörterbuch oder auch auf einzelne Übersetzungen sind immer herzlich willkommen!