Minimum Spanning Trees: Chapter 6s The Modern Corp. Problem Modern Corporation has decided to have a state-of-the-art fiber-optic network installed to.

Slides:

Advertisements

Similar presentations

ITS THE FINAL LECTURE! (SING IT, YOU KNOW YOU WANT TO) Operations Research.

Advertisements

Math for Liberal Studies.  A cable company wants to set up a small network in the local area  This graph shows the cost of connecting each pair of cities.

Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.

Chen, Lu Mentor: Zhou, Jian Shanghai University, School of Management Chen213.shu.edu.cn.

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 22 Network Problems.

3 C H A P T E R © 2001 The McGraw-Hill Companies, Inc. All Rights Reserved1 Getting Connected  First,you need to subscribe to an Internet service provider.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Project Analysis and Evaluation Chapter Eleven.

Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin CHAPTER SEVEN NETWORKS: MOBILE BUSINESS CHAPTER SEVEN NETWORKS:

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Credit and Inventory Management Chapter Twenty-One.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Working with Financial Statements Chapter Three.

Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Raising Capital Chapter Sixteen.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Options and Corporate Finance Chapter Fourteen.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Introduction to Valuation: The Time Value of Money Chapter Five.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Net Present Value and Other Investment Criteria Chapter Nine.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Short-Term Finance and Planning Chapter Nineteen.

McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., NETWORKS.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Determining the Target Cash Balance Chapter Twenty A.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Long-Term Financial Planning and Growth Chapter Four.

© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Interest Rates and Bond Valuation Chapter Seven.

© 2008 Prentice-Hall, Inc. Chapter 12 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.

The Mathematics of Networks

Network Flow Models Chapter 7.

CSE 550 Computer Network Design Dr. Mohammed H. Sqalli COE, KFUPM Spring 2007 (Term 062)

MNG221 - Management Science

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.

Computational Methods for Management and Economics Carla Gomes Module 9d Network Models Maximum Flow Problem (Slides adapted from J.Orlin’s and Hillier’s)

CMSC 150 INTRODUCTION TO COMPUTING CS 150: Mon 9 Jan 2012.

7.1 Chapter 7 Transmission Media Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Chapter 9A Network Basics.

Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 7 The Mathematics of Networks 7.1Trees 7.2Spanning Trees 7.3 Kruskal’s.

Table 1. Shipping costs, Supply, and Demand for Powerco Example

Algorithms for Network Optimization Problems This handout: Minimum Spanning Tree Problem Approximation Algorithms Traveling Salesman Problem.

McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Network Models Chapters 6 and 7.

7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

Shortest Route, Minimal Spanning Tree and Maximal Flow Models

Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.

Network Optimization Models

Introduction to Operations Research

Table of Contents Chapter 7 (Network Optimization Problems)

Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.

Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.

Network Optimization Problems

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.4 Trees.

Minimum Spanning Trees Prof. Sin-Min Lee Dept. of Computer Science, San Jose State University.

Minimum Spanning Trees Suppose G = (V, E) is a undirected network. Each edge (i,j) in E has an associated ‘length’ c ij (cost, time, distance, …) Determine.

Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,

Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 7 The Mathematics of Networks 7.1Trees 7.2Spanning Trees 7.3 Kruskal’s.

Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin APPENDIX B NETWORKS AND TELECOMMUNICATIONS APPENDIX B NETWORKS.

Chapter 9 Finding the Optimum 9.1 Finding the Best Tree.

Chapter 8 Network Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,

To change the sample image, select the picture and delete it. Now click the Pictures icon in the placeholder to insert your own image. Click Send to.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

ENGM 631 Minimum Spanning Tree. Prototype Example Seervada Park Trams route smallest total distance Phone lines minimum spanning tree Tram limitations.

7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.

McGraw-Hill/Irwin © 2003 The McGraw-Hill Companies, Inc., All Rights Reserved. Example 1-Ad A.

EMGT 5412 Operations Management Science Network Optimization Dincer Konur Engineering Management and Systems Engineering 1.

1 1 Slide © 2005 Thomson/South-Western Chapter 9 Network Models n Shortest-Route Problem n Minimal Spanning Tree Problem n Maximal Flow Problem.

Network Models Chapter 12

Minimal Spanning Trees and Graphs

Network Flow Problems – Shortest Path Problem

Network Models Chapter 12

Chapter 12 Network Models 12-1

Business Statistics with Quantitative Analysis

Section 14.4 Trees.

Network Models 7-1.

Prepared by Lee Revere and John Large

Network Models Chapter 12

Minimum spanning trees

Presentation transcript:

Minimum Spanning Trees: Chapter 6s The Modern Corp. Problem Modern Corporation has decided to have a state-of-the-art fiber-optic network installed to provide high-speed communication (data, voice, and video) between its major centers. Any pair of centers do not need to have a cable directly connecting them in order to take advantage of the technology. All that is necessary is to have a series of cables that connect the centers. Question: Which cables should be installed to provide high-speed communications between every pair of centers. Copyright © 2011 by the McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin

Modern Corporation’s Major Centers 6s-2

The Optimal Solution 6s-3

Assumptions of a Minimum-Spanning Tree Problem 1.You are given the nodes of a network but not the links. Instead, you are given the potential links and the positive cost (or a similar measure) for each if it is inserted into the network. 2.You wish to design the network by inserting enough links to satisfy the requirement that there be a path between every pair of nodes. 3.The objective is to satisfy this requirement in a way that minimizes the total cost of doing so. 6s-4

Algorithm for a Minimum-Spanning-Tree Problem 1.Choice of the first link: Select the cheapest potential link. 2.Choice of the next link: Select the cheapest potential link between a node that already is touched by a link and a node that does not yet have such a link. 3.Repeat step 2 over and over until every node is touched by a link (perhaps more than one). At that point, an optimal solution (a minimum spanning tree) has been obtained. (Ties for the cheapest potential link at each step may be broken arbitrarily.) 6s-5

Application of Algorithm to Modern Corp.: First Link 6s-6

Application of Algorithm to Modern Corp.: Second Link 6s-7

Application of Algorithm to Modern Corp.: Third Link 6s-8

Application of Algorithm to Modern Corp.: Fourth Link 6s-9

Application of Algorithm to Modern Corp.: Fifth Link 6s-10

Application of Algorithm to Modern Corp.: Final Link 6s-11

Applications of Minimum-Spanning-Tree Problems 1.Design of telecommunication networks (computer networks, lease-line telephone networks, cable television networks, etc.) 2.Design of a lightly-used transportation network to minimize the total cost of providing the links (rail lines, roads, etc.) 3.Design of a network of high-voltage electrical power transmission lines. 4.Design of a network of wiring on electrical equipment (e.g., a digital computer system) to minimize the total length of the wire. 5.Design of a network of pipelines to connect a number of locations. 6s-12