Translation for 'travelling salesman' from English to Slovak

travelling salesman

obchodný cestujúci {m}obch.práca

---

salesman

obchodný zástupca {m}obch.práca

predavač {m}obch.práca

predajca {m}obch.práca

Advertisement

traveling salesman

obchodný cestujúci {m}obch.práca

travelling

cestujúci {adj} {pres-p}

travelling circus

potulný cirkus {m}

putovný cirkus {m}

travelling bag

cestovná taška {f}turist.

travelling exhibition

putovná výstava {f}um.

Death of a Salesman [Arthur Miller]

Smrť obchodného cestujúcehodiv.lit.F

travelling theatre [Br.]

kočovné divadlo {n}div.

travelling [moving from place to place to perform, exhibit etc.]

potulný {adj}div.um.

kočovný {adj}div.um.

• In it, he solved a seven-node instance of the Hamiltonian Graph problem, an NP-complete problem similar to the travelling salesman problem.
• By the end of the first book, Sophia (whose name reflects her sophistication, as opposed to the constant Constance) has eloped with a travelling salesman.
• so that things might be safe for the travelling salesman, with his polygonal pince-nez, his fat, wet handshake, his grinning dentures".
• Jean Maddern Pitrone suggests that the idea was conceived after a travelling salesman told Woolworth of stores in Michigan with the five-cent counter concept.
• For example, in the travelling salesman problem each state is typically defined as a permutation of the cities to be visited, and the neighbors of any state are the set of permutations produced by swapping any two of these cities.

• Take the travelling salesman problem, for example.
• This routing problem is equivalent to the travelling salesman problem, which is NP complete, and therefore not amenable to a perfect solution in a reasonable time.
• In George Orwell's "Coming Up for Air", travelling salesman George Bowling regularly reminisces about the smell of sainfoin in his father's seed shop in Lower Binfield.
• This is commonly known as the travelling salesman problem.
• Other biographical elements include Williams’ mother being a Southern lady reflected in the Southern background of Stella and Blanche, and his father being a travelling salesman (as reflected in Stanley's character) who enjoyed drinking and playing poker with his friends.

• The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem approximately.
• The travelling salesman problem (also called the travelling salesperson problem or TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
• The Hamiltonian cycle problem is a special case of the travelling salesman problem, obtained by setting the distance between two cities to one if they are adjacent and two otherwise, and verifying that the total distance travelled is equal to "n" (if so, the route is a Hamiltonian circuit; if there is no Hamiltonian circuit then the shortest route will be longer).