Algorithms in a Nutshell

(^248) | Chapter 8: Network Flow Algorithms
Solution
We convert the Transportation problem instance into a Transshipment problem
instance with no intermediate warehouse nodes.
Assignment
The Assignment problem is simply a more restricted version of the Transporta-
tion problem: each supply node must supply only a single unit, and the demand
for each demand node is also one.
Figure 8-8. Sample Transshipment problem instance converted to Minimum Cost Flow
problem instance
Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.
Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use