traveling salesman

traveling salesman
One who travels from place to place, selling to retailers alone. Upchurch v LaGrange, 159 Ga 113, 125 SE 47. Often called a commercial traveler or commercial salesman. Known in an older day as a "drummer." A person who is employed to travel from one place to another to sell goods for his employer. Such a person is not a "day laborer" although by his contract with his employer he is paid by the day. Briscoe v Montgomery & Co. 93 Ga 662.

Ballentine's law dictionary. . 1998.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • traveling salesman — UK US noun [C] US OLD FASHIONED COMMERCE ► TRAVELLING SALESMAN(Cf. ↑travelling salesman) …   Financial and business terms

  • traveling salesman — noun count someone whose job is to travel to different places to sell goods from a particular company …   Usage of the words and phrases in modern English

  • traveling salesman — ☆ traveling salesman n. a salesperson who travels from place to place soliciting orders for the business firm he or she represents …   English World dictionary

  • traveling salesman — noun a salesman who travels to call on customers • Syn: ↑travelling salesman, ↑commercial traveler, ↑commercial traveller, ↑roadman, ↑bagman • Hypernyms: ↑salesman, ↑spokesperson, ↑ …   Useful english dictionary

  • Traveling Salesman Problem —   [engl.], Handlungsreisendenproblem …   Universal-Lexikon

  • Traveling-Salesman-Problem — Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Die angegebene Route ist die kürzeste von 43.589.145.600 möglichen. Das Problem des Handlungsreisenden (engl. Traveling Salesman Problem, kurz TSP) ist ein …   Deutsch Wikipedia

  • Traveling-Salesman-Tour — Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Die angegebene Route ist die kürzeste von 43.589.145.600 möglichen. Das Problem des Handlungsreisenden (engl. Traveling Salesman Problem, kurz TSP) ist ein …   Deutsch Wikipedia

  • Traveling Salesman Problem — Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Die angegebene Route ist die kürzeste von 43.589.145.600 möglichen. Das Problem des Handlungsreisenden (engl. Traveling Salesman Problem, kurz TSP) ist ein …   Deutsch Wikipedia

  • Traveling Salesman (film) — Infobox Film name = Traveling Salesman image size = caption = director = Joseph Henabery producer = writer = James Forbes Walter Woods narrator = starring = Fatty Arbuckle music = cinematography = Karl Brown editing = distributor = released = 5… …   Wikipedia

  • traveling salesman problem — any mathematical problem that involves determination of the shortest path through several points. [1950 55; from the idea that a traveling salesman would face such a problem in making rounds within a territory] * * * ▪ mathematics       an… …   Universalium

  • traveling salesman problem — any mathematical problem that involves determination of the shortest path through several points. [1950 55; from the idea that a traveling salesman would face such a problem in making rounds within a territory] …   Useful english dictionary

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”