Abstract
Abstract A large number of problems in transportation, communications and manufacturing can be modelled as network flow problems. In these problems one seeks to find the most efficient, or optimal, way to move flow (e.g. materials, information, buses, electrical currents) on a network (e.g. postal network, computer network, transportation grid, power grid). Many of these optimization problems are special classes of linear programming problems, with combinatorial properties that allow the development of efficient solution techniques. In this chapter, we limit our discussion to linear network flow problems. For a treatment of non-linear network flow problems, the reader is referred to [17, 28, 29, 48].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
