Movies about Traveling salesman
The art of selling has been one of the most popular topics since Hollywood began making films. There is something heart-racing about the interplay between buyer and seller that audiences react to with eager anticipation.
In this blog post, we have collected 10 of the most popular comedy and drama sales movies that any person, interested or working in sales, will totally fall in love with.
Smrt a Prodavač (1985)
The story of Willy Loman, an aging, traveling salesman in the midst of a serious life crisis. Suffering from financial woes and a deteriorating relationship with his beloved family, Willy dwells on various memories of his life and career as he looks back, trying to find out where it all went wrong.
Plechoví muži (1987)
A comedy about professional rivals in a door-to-door aluminum-siding sales business. The conflict between Bill “B.B.” Babowsky and Ernest Tilley becomes personal after a minor car accident that neither is willing to take the blame for. B.B. decides to take it even further by seducing Tilley’s wife.
Glengarry Glen Ross (1992)
An office full of New York City real estate agents finds out that all but the top two salesmen will be sacked by the end of the week. Shelley Levene, who has a sick daughter, does everything to get better leads from his boss, but to no effect. Things get quite dramatic after his coworker comes up with a plan to steal the leads.
Diamond Men (2000)
His whole life, Eddie Miller had been traveling around Pennsylvania, selling diamonds and jewelry to small shops, until a heart attack stopped him. When he got back to the office after a short period of recovery, the manager asked him to train his replacement, a rude young man with no experience in sales. Gradually, the two become good friends and the trainee introduces Eddie to Tina, a lady with a tough temper, but a kind heart.
Pronásledování štěstí (2006)
Chris Gardner, a San Francisco salesman with a soon-to-be-five-year-old son, loses his investment, his wife and apartment almost at once. He finds a job as an intern at a prestigious brokerage firm, however it hardly pays the bills. The two go through severe hardships, but Chris refuses to give up as he struggles to create a better life for his son and himself. Based on a true story.
Cedar Rapids (2011 XNUMX)
Insurance agent Tim Lippe has never stayed in a hotel, taken a plane, or even left his tiny hometown in Wisconsin. After he was chosen to represent his company at a convention in Iowa, Tim takes a long trip for the first time and meets three veteran attendees who put him on a course for a life-changing weekend.
Moneyball (2011)
Billy Beane, Oakland Athletics general manager, needs a new approach to recruiting when his star players leave the team. Peter Brand, a young Yale economics graduate, comes up with a new idea on how to assess players’ value. Beane recruits several small-time players basing his decision almost exclusively on their on-base percentage, which turns out to be a breakthrough approach.
Vlk z Wall Street (2013)
In 1987, Jordan Belfort takes an entry-level job at a Wall Street brokerage firm. Several years later he meets Stratton Oakmont. Belfort and his team of brokers make a fortune by defrauding wealthy investors.
Radost (2015)
A family story that spans four generations, centered on a woman who creates a business dynasty and becomes a matriarch in her own right. Facing betrayal and treachery, Joy becomes a true boss of her family and her enterprise.
Zakladatel (2016)
Ray Kroc, a salesman from Illinois, meets Mac and Dick McDonald, owners of a Southern California burger operation in the 1950s. Kroc sees the franchise potential in the brothers’ streamlined system of making food. Several years later, he buys out the entire company to create a multi-billion dollar empire.
Complete and e-sign Purchase Order Forms and Purchase Agreements on the go from any device with PDFfiller.
New York. Philadelphia. London. Cambridge. Phoenix. Washington D.C. Glasgow. Tel Aviv. Seoul. Hamburg. Hertfordshire. San Francisco. Athens. College Station. Milwaukee. Nanyang. Edinburgh. Ann Arbor.
Winner Best Feature Film
Silicon Valley Film Festival 2012
Picture Summary
Travelling Salesman is an intellectual thriller about four mathematicians hired by the U.S. government to solve the most elusive problem in computer science history — P vs. NP. The four have jointly created a «system» which could be the next major advancement for our civilization or destroy the fabric of humanity.
The solution’s immediate application would be for theoretical computer science. However, its application would soon extend to countless other disciplines. For example, by utilizing the solution to P vs. NP, a hacker could crack advanced encryption codes within seconds—a task that now takes weeks, months, or even years. He could break into La Guardia’s air traffic control or China’s communication grid. But the mathematical algorithm would also serve as the basis for accelerated biological research, curing diseases such as AIDS and cancer.
We begin the film with the four at a secret location waiting to meet with a high-ranking official of the United States Department of Defense. The group discusses the global implications of their solution, and they agree that they must be extremely careful with who they allow to control their discovery.
The silver-tongued DoD agent soon arrives and presents them each with an offer of 10 million dollars in exchange for their portion of the algorithmic solution. He attempts to deftly address their concerns and sway the opinions of the four.
In the end, only one mathematician speaks out against selling the solution. In pleading his case, he is forced to reveal the dark truth about his portion of the algorithm. As the mathematicians are about to sign documents that will give the U.S. government sole and private ownership of their solution, they wrestle with the moral dilemma of how this volatile discovery will be used. The math is real. The implications are real.
The Math Behind The Film
Projekt Problém P vs. NP is the most notorious unsolved problem in computer science. First introduced in 1971, it asks whether one class of problems (NP) is more difficult than another class (P).
Mathematicians group problems into classes based on how long they take to be solved and verified. «NP» is the class of problems whose answer can be verified in a reasonable amount of time. Some NP problems can also be solved quickly. Those problems are said to be in «P«, which stands for polynomial time. However, there are other problems in NP which have never been solved in polynomial time.
Otázkou je, is it possible to solve all NP problems as quickly as P problems? To date, no one knows for sure. Some NP questions seem harder than P questions, but they may not be.
Currently, many NP problems take a long time to solve. As such, certain problems like logistics scheduling and protein structure prediction are very difficult. Likewise, many cryptosystems, which are used to secure the world’s data, rely on the assumption that they cannot be solved in polynomial time.
If someone were to show that NP problems were not difficult—that P and NP problems were the same—it would would have significant practical consequences. Advances in bioinformatics and theoretical chemistry could be made. Much of modern cryptography would be rendered inert. Financial systems would be exposed, leaving the entire Western economy vulnerable.
Dokázat to P = NP would have enormous ramifications that would be equally enlightening, devastating, and valuable.
Stisknout
‘Travelling Salesman’ movie considers the repercussions if P equals NP by Duncan Geere, Wired
«Mathematical puzzles don’t often get to star in feature films, but P vs NP is the subject of an upcoming thriller»
«A movie that features science and technology is always welcome, but is it not often we have one that focuses on computer science. Cestující prodavač is just such a rare movie.»
Travelling Salesman — A Movie About P=NP by Alex Armstrong, I-Programmer
«We all know that the P=NP question is truly fascinating, but now it is about to be released as a movie.»
ACME Science Podcast Strongly Connected Components #46, ACME Science
«I speak with Timothy about where he got the idea for the movie, how he made sure that the mathematics was correct, and why science movies just may be the new comic book movies.»
The Travelling Salesman’s Power by Kenneth W. Regan, Gödel’s Lost Letter
«At last someone is taking the position that P = NP is a possibility seriously. If nothing else, the film’s brain trust realize that being equal is the cool direction, the direction with the most excitement, the most worthy of a major motion picture.»
Podcast: Rolling out the red carpet for the Travelling Salesman by Rachel Thomas, Plus Magazine
«Travelling Salesman is an unusual movie: despite almost every character being a mathematician there’s not a mad person in sight.»
Inspired by a famous math problem, “Travelling Salesman” is the story of the American government bringing together four mathematicians to prove p=np and the psychological consequences they face as a result of holding themselves responsible for the possible harm that can occur from sharing their findings with government officials. Put simply; the traveling salesman problem is as follows: imagine you are a traveling salesman. There are 50 cities you need to visit, and you are given the distances between them. Visiting each city only once, what is the shortest route you could take and order the cities you would need to visit to start and end your trip in the same city?
:max_bytes(150000):strip_icc()/last-of-us-streaming-8d93d5bc3ace46eea8cb15eea75320a5.jpg?w=350&resize=350,250)
/filters:quality(70)/400x400/thumbs/pw/jp/ub85grja5b6940a4e893d142624851_1080x1080.jpg?w=75&resize=75,75)
