Abstract
This chapter begins with an introduction to the Graphs Theory or Network Modelling. Next, the formulation of a varied set of network modelling problems is proposed with the corresponding solution. Specifically, shortest path problems, maximal flow problems, minimal spanning tree problems and minimal cost flow problems are contemplated. The solution is carried out using Ford and Bellman-Kalaba algorithms for minimum spanning problems, the Ford-Fulkerson algorithm for maximal flow problems and the Kruskal algorithm for the minimal spanning tree problems. Only the modelling of the minimal cost flow problems is presented. Therefore, different formulations for the problems are presented along with their solutions related to Industrial Organisation Engineering and the management setting.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anderson DR, Sweeney DJ, Williams TA, Wisniewski M (2009) An introduction to management science: quantitative approaches to decision making. South-Western CENGAGE Learning UK, UK
Appel K, Haken W (1977a) Every planar map is four colorable. Part I. Discharging. Ill J Math 21:429–490
Appel K, Haken W (1977b) Every planar map is four colorable. Part II. Reducibility. Ill J Math 21:491–567
Bellman R, Kalaba B (1960) On k-th best policies. SIAM J Appl Math 8(4):582–588
Bodin L, Golden B (1981) Classification in vehicle-routing and scheduling. Networks 11(2):97–108
Busacker RG, Gowen PJ (1961) A procedure for determining a family of minimal-cost network flow patterns. Technical report, Johns Hopkins University
Desrochers M, Lenstra JK, Savelsbergh MWP (1990) A classification scheme for vehicle-routing and scheduling problems. Eur J Oper Res 46(3):322–332
Euler L (1736) Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Scientarum Imperialis Petropolitanae 8:128–140
Ford LR Jr (1956) Network flow theory. Paper P-923, The RAND Corpo- ration, Santa Monica, CA
Ford LR Jr, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399–404
Hierholzer C (1873) Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechnung zu umfahren. Math Ann 6:30–32
Hillier FS, Lieberman GJ (2002) Introduction to operations research, 7th edn. McGraw Hill, San Francisco
Kruskal JB (1956) On the shortest spanning subtree and the traveling salesman problem. Proc Am Math Soc 7:48–50
Sylvester JJ (1878) Chemistry and algebra. Nature 17:284
Taha H (2010) Operations research: an introduction, 9th edn. Prentice Hall, Upper Saddle River
Winston WL (2003) Operations research: applications and algorithms, 4th edn. Duxbury Press, Belmont
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Poler, R., Mula, J., Díaz-Madroñero, M. (2014). Network Modelling. In: Operations Research Problems. Springer, London. https://doi.org/10.1007/978-1-4471-5577-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5577-5_4
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5576-8
Online ISBN: 978-1-4471-5577-5
eBook Packages: EngineeringEngineering (R0)