Abstract
In this section we discuss the second key problem within the class of general matching problems — the Hitchcock transportation problem (HTP). We have already shown that this problem can be viewed either as the specialization of the min-cost-flow problem on a directed bipartite graph or the specialization of the b-matching problem on a (nondirected) bipartite graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Derigs, U. (1988). The Hitchcock Transportation Problem. In: Programming in Networks and Graphs. Lecture Notes in Economics and Mathematical Systems, vol 300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51713-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-51713-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18969-5
Online ISBN: 978-3-642-51713-6
eBook Packages: Springer Book Archive