Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
15 Cards in this Set
- Front
- Back
|
What is a network? Be able to give some examples of networks.
|
A network is an arrangement of paths connected at various points, through which one or more items move from one point to another.
|
|
|
Be able to give some examples of networks.
|
example, highway systems, telephone networks, railroad systems, and television networks
|
|
|
Why are networks popular?
|
they provide a picture of a system.
-enables a manager to visually interpret the system and thus enhances the manager’s understanding. also popular because a large number of systems can be easily modeled as networks |
|
|
What are nodes?
|
denoted by circles, represent junction points connecting branches. typically represent localities, such as cities, intersections, or air or railroad terminals
|
|
|
What are branches?
|
represented as lines, connect nodes and show flow from one point to another. paths connecting the nodes such as roads connecting cities and intersections or air routes connecting terminals
|
|
|
What is the shortest route problem?
|
is to determine the shortest distance between an originating point and several destination points.
|
|
|
What are the steps of the shortest route solution method?
|
Select the node with the shortest direct route from the origin.
Establish a permanent set with the origin node and the node that was selected in step 1. Determine all nodes directly connected to the permanent set nodes. Select the node with the shortest route (branch) from the group of nodes directly connected to the permanent set nodes.Repeat steps 3 and 4 until all nodes have joined the permanent set. |
|
|
What is the minimal spanning tree problem?
|
objective is to connect all the nodes in the network so that the total branch lengths are minimized.
|
|
|
Be able to compare and contrast minimal spanning tree and shortest route.
|
in shortest route, it determines the shortest route from origin to destination. in spanning tree you find shortest distance for a connected network
|
|
|
What are the steps of the minimal spanning tree solution method? Be able to explain each step.
|
Select any starting node (conventionally, node 1 is selected).
Select the node closest to the starting node to join the spanning tree. Select the closest node not presently in the spanning tree. Repeat step 3 until all nodes have joined the spanning tree |
|
|
What did E.W. Dijkstra do?
|
he proposed the solution procedures for both minimal spanning tree problem and shortest route problem.
|
|
|
What is the maximal flow problem?
|
maximize the total amount of flow from an origin to a destination
|
|
|
How is the maximal flow problem different from the shortest route problem and the minimal spanning tree problem?
|
the maximal flow problem have limited flow capabilities.
|
|
|
What is the difference between directed branches and undirected branches?
|
in a directed branch the flow is possible in only one direction. In undirected branches, flow is possible in both directions.
|
|
|
What are the steps of the maximal flow solution method? Be able to explain each step.
|
Arbitrarily select any path in the network from origin to destination.
Adjust the capacities at each node by subtracting the maximal flow for the path selected in step 1. Add the maximal flow along the path in the opposite direction at each node. Repeat steps 1, 2 and 3 until there are no more paths with available flow capacity. |
