Übersetzung für 'traveling salesman' von Englisch nach Deutsch

traveling salesman [Am.]

Handelsreisender {m}

fliegender Händler {m}comm.

Geschäftsreisender {m}comm.jobs

---

Werbung

Traveling Salesman problem [Am.] <TSP>

Problem {n} des Handlungs­reisenden

---

traveling saturation [Am.] <traveling sat>

mitlaufende Sättigung {f} [mitlaufende Sättigungs­schicht]MedTech.

salesman

Händler {m}jobs

Geschäftsmann {m}

Vertriebler {m} [ugs.]

Verkäufer {m}jobs

insurance salesman

Versicherungs­verkäufer {m}insur.jobs

Versicherungs­vertreter {m}insur.jobs

same salesman

gleicher Verkäufer {m}

dummy salesman

stummer Verkäufer {m}

travelling salesman

Handelsreisender {m}comm.jobs

Geschäftsreisender {m}comm.jobs

Handlungs­reisender {m}jobs

fliegender Händler {m}comm.

vacuum salesman

Staubsaugerverkäufer {m}jobs

top salesman

Spitzenverkäufer {m}jobs

shoe salesman

Schuhverkäufer {m}comm.jobs

book salesman

Bücherverkäufer {m}jobs

car salesman

Autoverkäufer {m} [ugs.]automot.comm.jobs

Automobilverkäufer {m}automot.comm.jobs

retail salesman

Einzelhändler {m}jobs

• was away from home for long periods in his job as a traveling salesman—and his search for new musical ideas.
• Among the warmer memories of his childhood, Robbins recalled having listened to stories of the American West told by his maternal grandfather, 'Texas Bob' Heckle, who was a traveling salesman, raconteur and local medicine man.
• Both Alec Piersen and traveling salesman Mac Tilton propose to her, but she turns them both down.
• 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).
• Nikolaus August Otto was a traveling salesman for a grocery concern.

• He was the son of a traveling salesman and attended primary and secondary school in Tena before transferring at age 15 to a military college in Quito.
• He works as a traveling salesman in order to provide money for his sister and parents.
• 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 US, "solicitor" is also used to describe a traveling salesman (with a pejorative connotation roughly equivalent to the British English word tout) as in the signed warning on public places of accommodation, "No Soliciting".

• In the traveling salesman problem the goal is to minimize distance traveled.
• Another well-known NP-equivalent problem is the traveling salesman problem.
• 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.
• A binary search on the range of possible distances can convert the decision version of Traveling Salesman to the optimization version, by calling the decision version repeatedly (a polynomial number of times).
• 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.

• In 1968, McMahon graduated from East Carolina University with a business degree and after a nondescript career as a traveling salesman, he was eager to assume a managerial role in his father's World Wide Wrestling Federation promotion.