Section Hamilton Paths, and Hamilton Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
|
|
- Abigayle Cunningham
- 6 years ago
- Views:
Transcription
1 Section 14.3 Hamilton Paths, and Hamilton Circuits
2 What You Will Learn Hamilton Paths Hamilton Circuits Complete Graphs Traveling Salesman Problems
3 Hamilton Paths A Hamilton path is a path that contains each vertex of a graph exactly once
4 Hamilton Paths The graph shown has Hamilton path A, B, C, E, D. The graph also has Hamilton path C, B, A, D, E. Can you find some others?
5 Hamilton Paths The graph shown has Hamilton path A, B, C, F, H, E, G, D. The graph also has Hamilton path G, D, E, H, F, C, B, A. Can you find some others?
6 Hamilton Circuits A Hamilton circuit is a path that begins and ends at the same vertex and passes through all other vertices of the graph exactly one time
7 Hamilton Circuits The graph shown has Hamilton circuit A, B, C, E, D, A. Can you find another?
8 Hamilton Circuits The graph shown has Hamilton circuit A, B, D, G, E, H, F, C, A. A Hamilton circuit starts and ends at the same vertex
9 Complete Graph A complete graph is a graph that has an edge between each pair of its vertices
10 Example 2: Finding Hamilton Circuits Determine a Hamilton circuit for the complete graph shown. Solution One is: A, B, C, D, E, A There are many more
11 Number of Unique Hamilton Circuits in a Complete Graph The number of unique Hamilton circuits in a complete graph with n vertices is (n 1)!, where (n 1)! = (n 1)(n 2)(n 3) (3)(2)(1)
12 Example 4: American Idol Travel Steven Tyler, Jennifer Lopez, and Randy Jackson, the judges for the television show American Idol, are in Hollywood (H). They need to travel to the following cities to judge contestants auditions: San Antonio (SA), East Rutherford (ER), Birmingham (B), Memphis (M), and Seattle (S). In how many different ways can Steven, Jennifer, and Randy, traveling together, visit each of these cities and return to Hollywood?
13 Example 4: American Idol Travel Solution Represent this problem with the complete graph. 6 vertices represent the 6 locations. Edges represent the one-way flights between these locations
14 Example 4: American Idol Travel Solution Determine the number of Hamilton circuits. There are (6 1)! = 5! = = 120 different Hamilton circuits. There are 120 ways to start in Hollywood, visit the 5 cities and return to Hollywood
15 Traveling Salesman Problems Complete graphs can represent cities and the process of traveling between these cities. Our goal in a traveling salesman problem is to find the least expensive or shortest way to visit each city once and return home. In terms of graph theory, our goal is to find the Hamilton circuit with the lowest associated cost or distance
16 Traveling Salesman Problems The Hamilton circuit with the lowest associated cost (or shortest distance, etc.) is called the optimal solution. We will discuss two methods, the brute force method and the nearest neighbor method, for determining the optimal solution. A complete, weighted graph is a complete graph with the weights (or numbers) listed on the edges
17 The Brute Force Method of Solving Traveling Salesman Problems To determine the optimal solution: 1. Represent the problem with a complete, weighted graph. 2. List all possible Hamilton circuits for this graph. 3. Determine the cost (or distance) associated with each of these Hamilton circuits. 4. The Hamilton circuit with the lowest cost (or shortest distance) is the optimal solution
18 Example 5: Using the Brute Force Method Julienne Ward is the Southeast District Sales Director for Addison Wesley. On the next slide is a complete, weighted graph, whose numbers represent oneway fares, in dollars, between the cities. We want to use the brute force method to determine the optimal solution for Julienne to visit her regional sales offices
19 Example 5: Using the Brute Force Method She will start in Orlando (O); visit offices in Atlanta (A), Memphis (M), and New Orleans (N); and then return to Orlando
20 Example 5: Using the Brute Force Method Solution There are (4 1)! = 3! = 6 possible unique Hamilton circuits we need to examine for costs. We list these Hamilton circuits in the table on the next slide
21 Example 5: Using the Brute Force Method
22 Example 5: Using the Brute Force Method Solution Hamilton circuits in column 1. Columns 2 5 contain the cost associated with each leg of the circuit. Last column contains the total cost of travel using the given circuit. Two circuits have the lowest cost, $289. These two Hamilton circuits are shown on the maps on the next slide
23 Example 5: Using the Brute Force Method
24 Example 5: Using the Brute Force Method Solution The second circuit is the exact reverse order of the first circuit. Although these are different circuits, the cost is the same regardless of the direction flown. Either circuit provides Julienne with the least expensive way to visit each of her regional sales offices
25 Nearest Neighbor Method Now we introduce a method for finding an approximate solution to a traveling salesman problem. Approximate solutions can be used in cases where determining the optimal solution is not reasonable. One method for finding an approximate solution is the nearest neighbor method
26 Nearest Neighbor Method of Determining an Approximate Solution to a Traveling Salesman Problem To approximate a optimal solution: 1. Represent the problem with a complete, weighted graph. 2. Identify the starting vertex
27 Nearest Neighbor Method of Determining an Approximate Solution to a Traveling Salesman Problem 3. Of all the edges attached to the starting vertex, choose the edge that has the smallest weight. This edge is generally either the shortest distance or the lowest cost. Travel along this edge to the second vertex
28 Nearest Neighbor Method of Determining an Approximate Solution to a Traveling Salesman Problem 4. At the second vertex, choose the edge that has the smallest weight that does not lead to a vertex already visited. Travel along this edge to the third vertex
29 Nearest Neighbor Method of Determining an Approximate Solution to a Traveling Salesman Problem 5. Continue this process, each time moving along the edge with the smallest weight until all vertices are visited. 6. Travel back to the original vertex
30 Example 6: Using the Nearest Neighbor Method In Example 4, we discussed the American Idol judges plan to visit five cities in which auditions would take place and then return to Hollywood. Use the nearest neighbor method to determine an approximate solution for the judges visits. The one-way per person flight prices between cities are given in the table on the next slide
31 Example 6: Using the Nearest Neighbor Method
32 Example 6: Using the Nearest Neighbor Method Solution Here s the complete, weighted graph. Start at H, go to S. From S, go to SA. From SA, go to B. From B, go to ER. From ER, go to M. From M, go to H
33 Example 6: Using the Nearest Neighbor Method Solution H to S, $108 S to SA, $119 SA to B, $274 B to ER, $258 ER to M, $104 M to H, $144 Total cost is $
34 Example 6: Using the Nearest Neighbor Method Solution For comparison, here are 4 randomly chosen Hamilton circuits with costs
35 Example 6: Using the Nearest Neighbor Method Solution From the table, we see that the Hamilton circuit H, ER, M, B, S, SA, H results in a per person cost of $965, which is less than the $1007. Thus, we see that the nearest neighbor method does not always produce the optimal solution
36 Example 6: Using the Nearest Neighbor Method Solution The nearest neighbor method produces an approximation for the optimal solution. Without using the brute force method, we cannot determine if the Hamilton circuit H, ER, M, B, S, SA, H is the optimal solution
Section Hamilton Paths, and Hamilton Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 14.3 Hamilton Paths, and Hamilton Circuits INB Table of Contents Date Topic Page # September 11, 2013 Section 14.3 Examples/Handout 18 September 11, 2013 Section 14.3 Notes 19 2.3-2 What You Will
More informationChapter 14 Section 3 - Slide 1
AND Chapter 14 Section 3 - Slide 1 Chapter 14 Graph Theory Chapter 14 Section 3 - Slide WHAT YOU WILL LEARN Graphs, paths and circuits The Königsberg bridge problem Euler paths and Euler circuits Hamilton
More informationWarm -Up. 1. Draw a connected graph with 4 vertices and 7 edges. What is the sum of the degrees of all the vertices?
Warm -Up 1. Draw a connected graph with 4 vertices and 7 edges. What is the sum of the degrees of all the vertices? 1. Is this graph a. traceable? b. Eulerian? 3. Eulerize this graph. Warm-Up Eulerize
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 14-1 Chapter 14 Graph Theory 14.1 Graphs, Paths and Circuits Definitions A graph is a finite set of points called vertices (singular form is vertex) connected
More informationFinite Math A Chapter 6 Notes Hamilton Circuits
Chapter 6: The Mathematics of Touring (Hamilton Circuits) and Hamilton Paths 6.1 Traveling Salesman Problems/ 6.2 Hamilton Paths and Circuits A traveling salesman has clients in 5 different cities. He
More information1. The Highway Inspector s Problem
MATH 100 Survey of Mathematics Fall 2009 1. The Highway Inspector s Problem The Königsberg Bridges over the river Pregel C c d e A g D a B b Figure 1. Bridges f Is there a path that crosses every bridge
More informationThe Traveling Salesman Problem Brute Force Method
The Traveling Salesman Problem Brute Force Method Lecture 30 Sections 6.1, 6.3 Robb T. Koether Hampden-Sydney College Fri, Nov 3, 2017 Robb T. Koether (Hampden-Sydney College)The Traveling Salesman Problem
More informationThe Traveling Salesman Problem Outline/learning Objectives The Traveling Salesman Problem
Chapter 6 Hamilton Joins the Circuit Outline/learning Objectives To identify and model Hamilton circuit and Hamilton path problems. To recognize complete graphs and state the number of Hamilton circuits
More informationThe Traveling Salesman Problem Outline/learning Objectives The Traveling Salesman Problem
Chapter 6 Hamilton Joins the Circuit Outline/learning Objectives To identify and model Hamilton circuit and Hamilton path problems. To recognize complete graphs and state the number of Hamilton circuits
More informationChapter 6. The Traveling-Salesman Problem. Section 1. Hamilton circuits and Hamilton paths.
Chapter 6. The Traveling-Salesman Problem Section 1. Hamilton circuits and Hamilton paths. Recall: an Euler path is a path that travels through every edge of a graph once and only once; an Euler circuit
More informationTopics Covered. Introduction to Graphs Euler s Theorem Hamiltonian Circuits The Traveling Salesman Problem Trees and Kruskal s Algorithm
Graph Theory Topics Covered Introduction to Graphs Euler s Theorem Hamiltonian Circuits The Traveling Salesman Problem Trees and Kruskal s Algorithm What is a graph? A collection of points, called vertices
More informationSHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.
Chapter 6 Test Review Name SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Solve the problem. 1) The number of edges in K12 is 1) 2) The number of Hamilton
More information1. Read each problem carefully and follow the instructions.
SSII 2014 1 Instructor: Benjamin Wilson Name: 1. Read each problem carefully and follow the instructions. 2. No credit will be given for correct answers without supporting work and/ or explanation. 3.
More informationThe Traveling Salesman Problem
The Traveling Salesman Problem Hamilton path A path that visits each vertex of the graph once and only once. Hamilton circuit A circuit that visits each vertex of the graph once and only once (at the end,
More informationA path that visits every vertex exactly once is a Hamiltonian path. A circuit that visits every vertex exactly once is a Hamiltonian circuit.
Math 167 Review of Chapter 2 1 (c) Janice Epstein CHAPTER 2 BUSINESS EFFICENCY A path that visits every vertex exactly once is a Hamiltonian path. A circuit that visits every vertex exactly once is a Hamiltonian
More informationThe Travelling Salesman Problem
The Travelling Salesman Problem The travelling salesman problem cannot be solved directly without vast amounts of processing power, since every possible Hamiltonian cycle would need to be measured. For
More information14 Graph Theory. Exercise Set 14-1
14 Graph Theory Exercise Set 14-1 1. A graph in this chapter consists of vertices and edges. In previous chapters the term was used as a visual picture of a set of ordered pairs defined by a relation or
More informationMath for Liberal Arts MAT 110: Chapter 13 Notes
Math for Liberal Arts MAT 110: Chapter 13 Notes Graph Theory David J. Gisch Networks and Euler Circuits Network Representation Network: A collection of points or objects that are interconnected in some
More informationStudy Guide Mods: Date:
Graph Theory Name: Study Guide Mods: Date: Define each of the following. It may be helpful to draw examples that illustrate the vocab word and/or counterexamples to define the word. 1. Graph ~ 2. Vertex
More informationLesson 5.2. The Traveling Salesperson Problem. Explore This
Lesson 5.2 The Traveling alesperson Problem In Lesson 4.5, you explored circuits that visited each vertex of your graph exactly once (Hamiltonian circuits). In this lesson, you will extend your thinking
More informationThe Traveling Salesman Problem Nearest-Neighbor Algorithm
The Traveling Salesman Problem Nearest-Neighbor Algorithm Lecture 31 Sections 6.4 Robb T. Koether Hampden-Sydney College Fri, Apr 6, 2018 Robb T. Koether (Hampden-Sydney College)The Traveling Salesman
More informationA region is each individual area or separate piece of the plane that is divided up by the network.
Math 135 Networks and graphs Key terms Vertex (Vertices) ach point of a graph dge n edge is a segment that connects two vertices. Region region is each individual area or separate piece of the plane that
More information6.2 Initial Problem. Section 6.2 Network Problems. 6.2 Initial Problem, cont d. Weighted Graphs. Weighted Graphs, cont d. Weighted Graphs, cont d
Section 6.2 Network Problems Goals Study weighted graphs Study spanning trees Study minimal spanning trees Use Kruskal s algorithm 6.2 Initial Problem Walkways need to be built between the buildings on
More informationNote that there are questions printed on both sides of each page!
Math 1001 Name: Fall 2007 Test 1 Student ID: 10/5/07 Time allowed: 50 minutes Section: 10:10 11:15 12:20 This exam includes 7 pages, including this one and a sheet for scratch work. There are a total of
More informationMath 3012 Combinatorial Optimization Worksheet
Math 3012 Combinatorial Optimization Worksheet Combinatorial Optimization is the way in which combinatorial thought is applied to real world optimization problems. Optimization entails achieving the sufficient
More informationThe Traveling Salesman Problem (TSP) is where a least cost Hamiltonian circuit is found. CHAPTER 1 URBAN SERVICES
Math 167 eview 1 (c) Janice Epstein HPE 1 UN SEVIES path that visits every vertex exactly once is a Hamiltonian path. circuit that visits every vertex exactly once is a Hamiltonian circuit. Math 167 eview
More informationIE 102 Spring Routing Through Networks - 1
IE 102 Spring 2017 Routing Through Networks - 1 The Bridges of Koenigsberg: Euler 1735 Graph Theory began in 1735 Leonard Eüler Visited Koenigsberg People wondered whether it is possible to take a walk,
More informationEuler and Hamilton paths. Jorge A. Cobb The University of Texas at Dallas
Euler and Hamilton paths Jorge A. Cobb The University of Texas at Dallas 1 Paths and the adjacency matrix The powers of the adjacency matrix A r (with normal, not boolean multiplication) contain the number
More informationMATH 103: Contemporary Mathematics Study Guide for Chapter 6: Hamilton Circuits and the TSP
MTH 3: ontemporary Mathematics Study Guide for hapter 6: Hamilton ircuits and the TSP. nswer the questions above each of the following graphs: (a) ind 3 different Hamilton circuits for the graph below.
More informationSec 2. Euler Circuits, cont.
Sec 2. uler ircuits, cont. uler ircuits traverse each edge of a connected graph exactly once. Recall that all vertices must have even degree in order for an uler ircuit to exist. leury s lgorithm is a
More informationAmanur Rahman Saiyed (Indiana State University) THE TRAVELING SALESMAN PROBLEM November 22, / 21
. Amanur Rahman Saiyed (Indiana State University) THE TRAVELING SALESMAN PROBLEM November 22, 2011 1 / 21 THE TRAVELING SALESMAN PROBLEM Amanur Rahman Saiyed Indiana State University November 22, 2011
More informationOptimal tour along pubs in the UK
1 From Facebook Optimal tour along 24727 pubs in the UK Road distance (by google maps) see also http://www.math.uwaterloo.ca/tsp/pubs/index.html (part of TSP homepage http://www.math.uwaterloo.ca/tsp/
More informationSimple Graph. General Graph
Graph Theory A graph is a collection of points (also called vertices) and lines (also called edges), with each edge ending at a vertex In general, it is allowed for more than one edge to have the same
More informationAnnouncements. Quiz on Monday. Review Session at 5:00-6:30ish today in Padelford C-36. Project Proposals due one week from Monday Oct 22.
Announcements Quiz on Monday. Review Session at 5:00-6:30ish today in Padelford C-36. Project Proposals due one week from Monday Oct 22. Band Tour Problem You and the band want to tour the country this
More informationEuler and Hamilton circuits. Euler paths and circuits
1 7 16 2013. uler and Hamilton circuits uler paths and circuits o The Seven ridges of Konigsberg In the early 1700 s, Konigsberg was the capital of ast Prussia. Konigsberg was later renamed Kaliningrad
More informationSmart Solution for the Traveling Salesman Problem : Using Artificial Intelligent A* algorithm and Hamilton Circuit
Smart Solution for the Traveling Salesman Problem : Using Artificial Intelligent A* algorithm and Hamilton Circuit Hatem F. Halaoui Computer Science and Mathematics Division Haigazian University Beirut,
More informationMTH-129 Review for Test 4 Luczak
MTH-129 Review for Test 4 Luczak 1. On each of three consecutive days the National Weather Service announces that there is a 50-50 chance of rain. Assuming that they are correct, answer the following:
More informationPATH FINDING AND GRAPH TRAVERSAL
GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest path between two vertices in a graph. We discussed the Floyd Warshall algorithm previously, but you may
More informationA COMPARATIVE STUDY OF BRUTE FORCE METHOD, NEAREST NEIGHBOUR AND GREEDY ALGORITHMS TO SOLVE THE TRAVELLING SALESMAN PROBLEM
IMPACT: International Journal of Research in Engineering & Technology (IMPACT: IJRET) ISSN(E): 2321-8843; ISSN(P): 2347-4599 Vol. 2, Issue 6, Jun 2014, 59-72 Impact Journals A COMPARATIVE STUDY OF BRUTE
More informationDesign and Analysis of Algorithms
CS4335: Design and Analysis of Algorithms Who we are: Dr. Lusheng WANG Dept. of Computer Science office: B6422 phone: 2788 9820 e-mail: lwang@cs.cityu.edu.hk Course web site: http://www.cs.cityu.edu.hk/~lwang/ccs3335.html
More informationChapter 14. Graphs Pearson Addison-Wesley. All rights reserved 14 A-1
Chapter 14 Graphs 2011 Pearson Addison-Wesley. All rights reserved 14 A-1 Terminology G = {V, E} A graph G consists of two sets A set V of vertices, or nodes A set E of edges A subgraph Consists of a subset
More informationMaximum Flows of Minimum Cost
Maximum Flows of Minimum Cost Figure 8-24 Two possible maximum flows for the same network Data Structures and Algorithms in Java 1 Maximum Flows of Minimum Cost (continued) Figure 8-25 Finding a maximum
More information1. trees does the network shown in figure (a) have? (b) How many different spanning. trees does the network shown in figure (b) have?
2/28/18, 8:24 M 1. (a) ow many different spanning trees does the network shown in figure (a) have? (b) ow many different spanning trees does the network shown in figure (b) have? L K M P N O L K M P N
More informationDesign and Analysis of Algorithms
CSE 101, Winter 018 D/Q Greed SP s DP LP, Flow B&B, Backtrack Metaheuristics P, NP Design and Analysis of Algorithms Lecture 8: Greed Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ Optimization
More informationCSCE 350: Chin-Tser Huang. University of South Carolina
CSCE 350: Data Structures and Algorithms Chin-Tser Huang huangct@cse.sc.edu University of South Carolina Announcement Homework 2 will be returned on Thursday; solution will be available on class website
More informationTopic 10 Part 2 [474 marks]
Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed
More informationTravelling Salesman Problem. Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij
Travelling Salesman Problem Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij 1 Contents TSP and its applications Heuristics and approximation algorithms Construction heuristics,
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu P, NP-Problems Class
More informationMathematical Thinking
Mathematical Thinking Chapter 2 Hamiltonian Circuits and Spanning Trees It often happens in mathematics that what appears to be a minor detail in the statement of a problem can have a profound effect on
More informationComputer Science 385 Design and Analysis of Algorithms Siena College Spring Topic Notes: Brute-Force Algorithms
Computer Science 385 Design and Analysis of Algorithms Siena College Spring 2019 Topic Notes: Brute-Force Algorithms Our first category of algorithms are called brute-force algorithms. Levitin defines
More informationCSC Design and Analysis of Algorithms. Lecture 4 Brute Force, Exhaustive Search, Graph Traversal Algorithms. Brute-Force Approach
CSC 8301- Design and Analysis of Algorithms Lecture 4 Brute Force, Exhaustive Search, Graph Traversal Algorithms Brute-Force Approach Brute force is a straightforward approach to solving a problem, usually
More informationEffective Tour Searching for Large TSP Instances. Gerold Jäger
Effective Tour Searching for Large TSP Instances Gerold Jäger Martin-Luther-University Halle-Wittenberg (Germany) joint work with Changxing Dong, Paul Molitor, Dirk Richter German Research Foundation Grant
More informationUnit 7 Day 6. Section 5.2 Traveling Salesman Problem & Section 5.3 Finding the Shortest Route
Unit 7 Day 6 Section 5.2 Traveling Salesman Problem & Section 5.3 Finding the Shortest Route 1 Warm Up Day 7: 1. Draw a planar graph with 6 vertices. 2. Is a K 9,3 graph planar? Explain your reasoning.
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
MATH 100 -- Survery of Mathematical Ideas PRACTICE TEST 3 Millersville University, Spring 2012 Ron Umble, Instr. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers
More informationChapter 5 Review. 1. Write a summary of what you think are the important points of this chapter.
DM_Final.qxp:DM.qxp // 8: AM Page 89 Chapter Review. Write a summary of what you think are the important points of this chapter.. Is the following graph planar or nonplanar? If it is planar, redraw it
More informationUndirected Network Summary
Undirected Network Summary Notice that the network above has multiple edges joining nodes a to d and the network has a loop at node d. Also c is called an isolated node as it is not connected to any other
More informationModule 6 P, NP, NP-Complete Problems and Approximation Algorithms
Module 6 P, NP, NP-Complete Problems and Approximation Algorithms Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu
More informationTraveling Salesman Problem. Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij
Traveling Salesman Problem Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij 1 Contents TSP and its applications Heuristics and approximation algorithms Construction heuristics,
More informationFactor Quadratic Expressions
Factor Quadratic Expressions BLM 6... BLM 6 Factor Quadratic Expressions Get Ready BLM 6... Graph Quadratic Relations of the Form y = a(x h) + k. Sketch each parabola. Label the vertex, the axis of symmetry,
More information8 NP-complete problem Hard problems: demo
Ch8 NPC Millennium Prize Problems http://en.wikipedia.org/wiki/millennium_prize_problems 8 NP-complete problem Hard problems: demo NP-hard (Non-deterministic Polynomial-time hard), in computational complexity
More information56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997
56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997 Answer #1 and any five of the remaining six problems! possible score 1. Multiple Choice 25 2. Traveling Salesman Problem 15 3.
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 397 E-mail: natarajan.meghanathan@jsums.edu Optimization vs. Decision
More informationConcur Cliqbook Travel New User Interface
The enhanced User Interface (UI) known as Hooville was designed to improve the user experience in many ways, including increased usability, improved filtering, and more search results. Using the wizard
More information(Refer Slide Time: 01:00)
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture minus 26 Heuristics for TSP In this lecture, we continue our discussion
More informationEECS 203 Lecture 20. More Graphs
EECS 203 Lecture 20 More Graphs Admin stuffs Last homework due today Office hour changes starting Friday (also in Piazza) Friday 6/17: 2-5 Mark in his office. Sunday 6/19: 2-5 Jasmine in the UGLI. Monday
More informationPrecept 4: Traveling Salesman Problem, Hierarchical Clustering. Qian Zhu 2/23/2011
Precept 4: Traveling Salesman Problem, Hierarchical Clustering Qian Zhu 2/23/2011 Agenda Assignment: Traveling salesman problem Hierarchical clustering Example Comparisons with K-means TSP TSP: Given the
More informationHonors ICM- Graph Theory Unit 7 Homework Packet Homework Day 1
Honors ICM- Graph Theory Unit 7 Homework Packet Homework Day 1 Name Period: 6. Construct a graph with three critical paths. 7. Determine the minimum project time and the critical path for the following
More informationCHAPTER FOURTEEN GRAPH THEORY
HPTR OURTN RPH THORY xercise Set 14.1 1. graph is a finite set of points, called vertices, that are connected with line segments, called edges. 2. 3. 4. The degree of a vertex is the number of edges that
More informationJunior Circle Meeting 3 Circuits and Paths. April 18, 2010
Junior Circle Meeting 3 Circuits and Paths April 18, 2010 We have talked about insect worlds which consist of cities connected by tunnels. Here is an example of an insect world (Antland) which we saw last
More informationCSE 21 Summer 2017 Homework 4
CSE 21 Summer 201 Homework Key Concepts Minimum Spanning Trees, Directed Acyclic Graphs, Topological Sorting, Single source shortest paths, Counting, Basic probability principles, Independence, Linearity
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many
More informationLecture 10 Graph Algorithms
Lecture 10 Graph Algorithms Euiseong Seo (euiseong@skku.edu) 1 Graph Theory Study of the properties of graph structures It provides us with a language with which to talk about graphs Keys to solving problems
More informationQuestions... How does one show the first problem is NP-complete? What goes on in a reduction? How hard are NP-complete problems?
Even More NP Questions... How does one show the first problem is NP-complete? What goes on in a reduction? How hard are NP-complete problems? Reduction We say that problem A reduces to problem B, if there
More informationQuestions? You are given the complete graph of Facebook. What questions would you ask? (What questions could we hope to answer?)
P vs. NP What now? Attribution These slides were prepared for the New Jersey Governor s School course The Math Behind the Machine taught in the summer of 2011 by Grant Schoenebeck Large parts of these
More information56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998
56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998 Part A: Answer any four of the five problems. (15 points each) 1. Transportation problem 2. Integer LP Model Formulation
More informationOptimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP).
Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP). Liew Sing liews_ryan@yahoo.com.sg April 1, 2012 Abstract In this paper, the author proposes optimal tree as a gauge for the
More informationGraph Applications, Class Notes, CS 3137 1 Traveling Salesperson Problem Web References: http://www.tsp.gatech.edu/index.html http://www-e.uni-magdeburg.de/mertens/tsp/tsp.html TSP applets A Hamiltonian
More informationBrute Force: Selection Sort
Brute Force: Intro Brute force means straightforward approach Usually based directly on problem s specs Force refers to computational power Usually not as efficient as elegant solutions Advantages: Applicable
More informationWith your construction team, create a list of the 10 most important necessities for completing the development of the island:
Names: You have been given an island off the coast of Japan by your long-lost Aunt! She has tasked you with developing the land to be suitable for citizens. Since she rules Japan from the main island of
More informationQuick Guide to Concur Upgrade
Office of the Quick Guide to Concur 2.0 2015 Upgrade MIT s newly upgraded travel system, Concur 2.0, features an improved user interface and capabilities requested by MIT travelers and administrators.
More informationReal-World Applications of Graph Theory
Real-World Applications of Graph Theory St. John School, 8 th Grade Math Class February 23, 2018 Dr. Dave Gibson, Professor Department of Computer Science Valdosta State University 1 What is a Graph? A
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 97 E-mail: natarajan.meghanathan@jsums.edu Optimization vs. Decision
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationProblem A: Optimal Array Multiplication Sequence
Problem A: Optimal Array Multiplication Sequence Source: Input: Output: array.{c cc cpp} stdin stdout Given two arrays A and B, we can determine the array C = A B using the standard definition of matrix
More informationShortest Paths. CSE 373 Data Structures Lecture 21
Shortest Paths CSE 7 Data Structures Lecture Readings and References Reading Section 9., Section 0.. Some slides based on: CSE 6 by S. Wolfman, 000 //0 Shortest Paths - Lecture Path A path is a list of
More informationCS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs
CS 311 Discrete Math for Computer Science Dr. William C. Bulko Graphs 2014 Definitions Definition: A graph G = (V,E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge
More informationACT Diagnostic Review #1
Name Date Score ACT Diagnostic Review #1 1. Gabe biked a total of kilometers over the course of his morning and afternoon bike rides. If he biked a distance of in the afternoon? kilometers in the morning,
More informationAlgebra 1 Interactive Chalkboard Copyright by The McGraw-Hill Companies, Inc. Send all inquiries to:
Algebra 1 Interactive Chalkboard Copyright by The McGraw-Hill Companies, Inc. Send all inquiries to: GLENCOE DIVISION Glencoe/McGraw-Hill 8787 Orion Place Columbus, Ohio 43240 Lesson 4-1 The Coordinate
More informationCCGPS Accelerated Pre-Calculus Unit Five Assignment Packet
Page 1 Name: Block: CCGPS Accelerated Pre-Calculus Unit Five Assignment Packet Note: This packet is to be completed and turned in no later than. Please be sure to write your last name in ink at the top
More informationNew Versions of Adjacency The Traveling Salesman Problem Example V (5 Cities) Brute Force Algorithm & Permutations 48 State Capital Example Random
Intro Math Problem Solving December 7 New Versions of Adjacency The Traveling Salesman Problem Example V (5 Cities) Brute Force Algorithm & Permutations 48 State Capital Example Random Sampling Algorithm
More informationTravelling salesman problem using reduced algorithmic Branch and bound approach P. Ranjana Hindustan Institute of Technology and Science
Volume 118 No. 20 2018, 419-424 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Travelling salesman problem using reduced algorithmic Branch and bound approach P. Ranjana Hindustan
More informationTest Booklet. Subject: MA, Grade: 10 TAKS Grade 10 Math Student name:
Test Booklet Subject: MA, Grade: 10 TAKS Grade 10 Math 2009 Student name: Author: Texas District: Texas Released Tests Printed: Saturday July 14, 2012 1 The grid below shows the top view of a 3-dimensional
More informationICS 451: Today's plan. Network Layer Protocols: virtual circuits Static Routing Distance-Vector Routing
ICS 451: Today's plan Network Layer Protocols: virtual circuits Static Routing Distance-Vector Routing Virtual Circuits: Motivation Implementing the routing table in hardware can be expensive to make it
More informationLecture 1: An Introduction to Graph Theory
Introduction to Graph Theory Instructor: Padraic Bartlett Lecture 1: An Introduction to Graph Theory Week 1 Mathcamp 2011 Mathematicians like to use graphs to describe lots of different things. Groups,
More informationCoping with the Limitations of Algorithm Power Exact Solution Strategies Backtracking Backtracking : A Scenario
Coping with the Limitations of Algorithm Power Tackling Difficult Combinatorial Problems There are two principal approaches to tackling difficult combinatorial problems (NP-hard problems): Use a strategy
More informationDesign and Analysis of Algorithms CS404/504. Razvan Bunescu School of EECS.
Welcome Design and Analysis of Algorithms Razvan Bunescu School of EECS bunescu@ohio.edu 1 Course Description Course Description: This course provides an introduction to the modern study of computer algorithms.
More informationUTILIZATION OF GIS AND GRAPH THEORY FOR DETERMINATION OF OPTIMAL MAILING ROUTE *
UTILIZATION OF GIS AND GRAPH THEORY FOR DETERMINATION OF OPTIMAL MAILING ROUTE * Dr. Mufid Abudiab, Michael Starek, Rene Lumampao, and An Nguyen Texas A&M University-Corpus Christi 1500 Ocean Drive Corpus
More informationc Department of Math and Stat
Math 1300 Final Exam Spring 2015 c Department of Math and Stat Texas Tech University Instructions: For full credit, you must show complete, correct, legible work. All work and answers must be recorded
More informationLecture 3. Brute Force
Lecture 3 Brute Force 1 Lecture Contents 1. Selection Sort and Bubble Sort 2. Sequential Search and Brute-Force String Matching 3. Closest-Pair and Convex-Hull Problems by Brute Force 4. Exhaustive Search
More informationInstant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006
Instant Insanity Instructor s Guide Make-it and Take-it Kit for AMTNYS 2006 THE KIT: This kit contains materials for two Instant Insanity games, a student activity sheet with answer key and this instructor
More information