QUAN-True & False

QUAN-True & False - Questions Minimum Spanning Tree 1....

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Questions Minimum Spanning Tree 1. Minimum spanning tree problems can be solved as an LP problem 2. A tie between the nodes means that no optimal solution can be found 3. The number of arcs in a spanning tree is n-1 Shortest Path 1. Shortest path problems find the shortest path or route through the network from origin to destination 2. Nodes in a network are such that there are many paths available from origin to destination 3. Shortest path problems are used by many cities to develop computerized models of their highways and streets to help emergency vehicles identify the quickest route to a given location. 4. Solving a shortest path problem as a network flow model requires the various nodes to have some supply or demand 5. A shortest path problem has capacity constraints Max Flow 1. A max-flow problem contains a network with only a specific starting point 2. All nodes have a net flow of 0 3. A dummy arc flows form origin to destination 4. Capacity of the dummy arc is 0 5. Max flow problems find the maximum flow that can occur from origin to destination through
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/07/2008 for the course BUSSPP 0001 taught by Professor Rafferty during the Spring '08 term at Pittsburgh.

Page1 / 2

QUAN-True & False - Questions Minimum Spanning Tree 1....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online