Page 364 -
P. 364
Chapter 8
Network Models
8.1 Shortest-Route Problem 8.3 Maximal Flow Problem
A Shortest-Route Algorithm
8.2 Minimal Spanning Tree Problem
A Minimal Spanning Tree Algorithm
Learning Objectives By the end of this chapter you will be able to formulate, solve and interpret
in a business context a variety of network models including:
l Shortest-route networks
l Minimal spanning tree networks
l Maximal flow networks
344
Copyright 2014 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s). Editorial review has
deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
