Where in the world would you go Marty Absher. Cities  Charlotte, NC  I never go here much.  Carowinds  Charlotte Coliseum.

Slides:



Advertisements
Similar presentations
Grammar focus 1.When we come back, well enjoy a show at the Sydney Opera House in the evening. 2.Once you are in Sydney, it is a must-do.
Advertisements

East Coast Trip !!! Coming to YOU Summer 2013 June 27 – July 7, 2013 Time Square NYC.
ITS THE FINAL LECTURE! (SING IT, YOU KNOW YOU WANT TO) Operations Research.
Chapter 7 Graph Theory 7.1 Modeling with graphs and finding Euler circuits. Learning Objectives: Know how to use graphs as models and how to determine.
7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.
1 Minimal Spanning Tree This is a technique used when we need to connect many places to a system(network).
Minimum Spanning Network: Brute Force Solution
A traveling salesman has customers in 5 cities which we will call A, B, C, D, and E. The salesman needs to travel to all 5 cities with his trip starting.
Grammar Skills Special Nouns. We are going on a trip to New York City. Where is the writer going? New York Do these words tell a bout any city or a certain.
Presented By:Sobia Welcome to New York City  Today, I will be talking about New York City.  The Population, weather, Official language, Currency, National.
New York City and ME Written by Sylvie Cucui Speech Therapist P79M.
Around the world in 30 Days By: Rolando Sanchez. Houston Hometown Family lives there Want to go and visit the neighborhood I once lived in.
New York City The Big Apple By: Shelby Dupler. Attractions and Activities There are a lot of fun experiences, places and people in New York city. Here.
NNew York is an endlessly diverse place. With all of the numerous museums and attractions, students can learn everything from history to biology to.
A Trip to England Nicholas Grice Angela Miranda A2 Computer Science 1.
SYDNEY BY ANTONIO BLITVIĆ AND MAXIM NOAH VUČKOVIĆ PRODUCED BY MAXIM AND ANTONIO.
Australia By Ellen Thai Period 4. Travel  V Australia  Departing: Nov 24 th  Returning: Feb 4 th  Departure from Logan Airport: 1:30 pm  Arrival.
Australia.
Tokyo And the land of the Rising Sun. What can Japan Offer You will learn of Japans rich cultural background from visiting national museums, and parks,
Geography and CS Philip Chan. How do I get there? Navigation Which web sites can give you turn-by-turn directions?
Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.
Slide 14-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Sydney, Australia By: Emma Meine. I’m going to tell you about the amazing sites you could see if you went the outstanding Sydney, Australia!!!!! Sydney.
By Yusuf Ogretici Tourist Brochure.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
Australia. facts: Australia is the worlds 6 th largest country by area. The largest cities in Australia are Sydney,Melbourne,Brisbane,Perth and Adelaide.
Slide Copyright © 2009 Pearson Education, Inc. AND Active Learning Lecture Slides For use with Classroom Response Systems Chapter 14 Graph Theory.
Graph Theory Hamilton Paths and Hamilton Circuits.
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
My Trip Around Australia Land Down Under Which Places Will I Be Visiting? Adelaide Sydney Melbourne Brisbane.
Stage 1 Rich Task Term Your task… You and your partner will need to create a PowerPoint presentation all about Japan. A friend of yours is moving.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
6.1 Hamilton Circuits and Paths: Hamilton Circuits and Paths: Hamilton Path: Travels to each vertex once and only once… Hamilton Path: Travels to each.
Australia Australia is the smallest, and the youngest continent.And It is the largest island in the world. It is divided from other continents by large.
Spring 2015 Mathematics in Management Science Traveling Salesman Problem Approximate solutions for TSP NNA, RNN, SEA Greedy Heuristic Algorithms.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 4.2, Slide 1 4 Graph Theory (Networks) The Mathematics of Relationships 4.
By: Jacob Harrs. Hometown: Charlotte, NC  Attractions Carowinds US National Whitewater Center  Random Facts 18 th most populous city in the US Named.
Ultra-Fast Broadband By Elliot Paton-Simpson. Ultra-Fast Broadband Owairaka and the surrounding region has decided to install an ultra-fast broadband.
AUSTRALIA Amber Roan Circular Quay, Botanical Gardens, Walking Trails, Bridges, and More!!!
 Graphs  Paths  Circuits  Euler. Traveling Salesman Problems.
EXCURSIONS IN MODERN MATHEMATICS SIXTH EDITION Peter Tannenbaum 1.
Mathematics in Management Science
By: Christophe Dufour Chrishon Adams Mischael Joseph.
Study area: Knaresborough LOCATION IN THE UK Describe the location of where Knaresborough is in the UK -County -Nearest cities/towns -Ports -Airports.
Network Problems A D O B T E C
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Unit 2 Hamiltonian Circuits. Hamiltonian Circuit: A tour that starts at a vertex of a graph and visits each vertex once and only once, returning to where.
5 DAY ROAD TRIP BY: THIS GUY. 3 HOURS TO DESTINATION From Salt Lake City, Utah to New York City, New York it will take about 3 hours by plane. The cost.
The Traveling Salesman Starring: Mr. Brute Force Co Starring: Mrs. Sorted Edge Lord Nearest Neighbor.
Monday, April 4, 2016 ESL Level 3 Week 7. Announcements Wednesday, CASAS #2 Thursday, Grammar test from Units 7-12.
SIDNEY. Culture Sídney receives different festivals and some of the biggest social and cultural events of Australia.
Air Bridge Travel Let Air bridge compare everything that you might want to bargain for your travel. Whether it is cheap flights or holidays or hotel rooms.
Hamilton Paths and Hamilton Circuits
Excursions in Modern Mathematics Sixth Edition
Weighted Graphs and traveling Salesperson problem
New York places and monuments
NYC landmarks quiz.
Quiz Review.
Shortest Path.
Welcome to the unit.
Warm Up – Friday.
Shortest Path Problems
Graph Theory I In today’s lesson we will look at:
SAT PREP UPSTREAM / DOWNSTREAM & MOTION Rita Korsunsky.
Copyright ©2012 by Pearson Education, Inc. All rights reserved
Section 13.4 Trees.
Warm Up – Monday Calculate the Redundancy of the above network.
New York City Sites and Sounds.
Geography is Awesome!.
Uvod: New York has somethink for everyone.. Uvod: New York has somethink for everyone.
Presentation transcript:

Where in the world would you go Marty Absher

Cities  Charlotte, NC  I never go here much.  Carowinds  Charlotte Coliseum

Cities  Mt. Fuji, Japan  I’ve always wanted to see the blossoms from the cherry trees.  Mount Fuji Jazz Festival  Mt fuji Lake

Cities  Yorkshire, U.K.  It would be interesting to see the forms of architecture from different eras of time  Historic buildings and sites

Cities  Sydney, Australia  I would like to see the opera house, and also visit the beaches quite often.  Sydney Harbour National Park  Beaches

Cities  New York, New york  I want to know what city life is really like; and if it’s the same as on TV.  Central Park  Metropolitan Museum of Art  Brooklyn Bridge

Cost DollarsCMYSN CN/A M1898N/A Y N/A S N/A2595 N N/A

Brute Force method – Takes longer, but will get you the best route. Also, it is only practical for up to a certain amount of vertices CSMYNC = $4865

c Y N S M Repetitive nearest neighbor – is faster, but might not get you the absolute best way CNYMSC YNCSMY NCSMYN SMYNCS MYNCSM CNYMSC = $4865

Cheapest Link – You use a cheap route, but there could be a cheaper one. c Y N S M 245y 759y 957y 1097y 1495n 1597n 1807y 1898n 2095n 2597n CNYMSC = $4865

Kruskal– It is cheapest, but it can’t be done c Y N S M CNYMSC = $3058

Distance milesCMYSN CN/A M N/A Y N/A S N/A N N/A

Brute Force method – Takes longer, but will get you the best route. Also, it is only practical for up to a certain amount of vertices CSMYNC = miles

c Y N S M Repetitive nearest neighbor – fast flight, but might not be the fastest CNYMSC = miles CNYMSC YNCSMY NCSMYN SMYNCS MYNCSM

Cheapest Link – You use the shortest individual paths as possible, but still might not get the shortest overall c Y N S M CNYMSC = miles

Kruskal– is the shortest network to all places, but it isn't possible c Y N S M CNYMSC = miles

Calendar Start Destination End Destination Date/timeDistanceCost CharlotteSydney2/1 12:34 a.m $1807 SydneyMt Fuji2/7 10:46 a.m $1097 Mt FujiYorkshire2/13 8:25 a.m $957 YorkshireNew York (NYC) 2/19 6:17 a.m $759 New YorkCharlotte2/25 9:15 p.m $245