Mgt Science Chp 11

Front 1

Three network models are
covered in this chapter.

Back 1

the minimal-spanning tree problem, the maximal-flow
problem, and the shortest-route problem.

Front 2

The minimal-spanning tree technique determines the ...

Back 2

path through the network that connects all the points
while minimizing total distance.

Front 3

The maximal-flow technique finds the

Back 3

maximum flow of any quantity or substance through a network

Front 4

shortest-route technique can find ..

Back 4

the shortest path through a network

Front 5

The points on the network are referred
to as ______. Typically these are presented as circles, although sometimes squares or rectangles
are used. The lines connecting the _____ are called ____.

Back 5

nodes
nodes arcs

Front 6

The telephone
companies to connect a number of phones together while minimizing the total length of tele-
phone cable is an example of what technique

Back 6

minimal-spanning tree technique

Front 7

There are four steps for the
minimal-spanning tree problem

Back 7

Front 8

The maximal-flow problem involves determining the ...

Back 8

maximum amount of material that can
flow from one point (the source) to another (the sink) in a network.

Front 9

Determining the maximum number of cars that can flow through a highway sys-
tem, the maximum amount of a liquid that can flow through a series of pipes, and the maximum
amount of data that can flow through a computer network are examples of what technique.

Back 9

Maximal-flow

Front 10

The four maximal-flow
technique steps.

Back 10

Front 11

The objective of the shortest-route problem is to find the shortest distance from one location to
another. In a network, this often involves determining the ...

Back 11

shortest route from one node to each
of the other nodes.
- This problem can be solved either by the shortest-route technique or by mod-
eling this as a linear program with 0–1 variables.

Front 12

The steps of the shortest-route
technique.

Back 12

Front 13

Arc

Back 13

A line in a network that may represent a path or route.
An arc or branch is used to connect the nodes in a network.

Front 14

Maximal-Flow Problem

Back 14

A network problem with the objec-
tive of determining the maximum amount that may flow
from the origin or source to the final destination or sink.

Front 15

Minimal-Spanning Tree Problem

Back 15

A network problem with
the objective of connecting all the nodes in the network
while minimizing the total distance required to do so.

Front 16

Node

Back 16

A point in a network, often represented by a circle,
that is at the beginning or end of an arc.

Front 17

Shortest-Route Problem

Back 17

A network problem with the
objective of finding the shortest distance from one location
to another.

Front 18

Sink

Back 18

The final node or destination in a network.

Front 19

Source

Back 19

The origin or beginning node in a network.