Thesis (M.S.)--Missouri University of Science and Technology, 2008. / Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed May 19, 2008) Includes bibliographical references (p. 33-35).

Thesis (Ph. D.)--West Virginia University, 1998. / Title from document title page. Document formatted into pages; contains v, 87 p. : ill. Includes abstract. Includes bibliographical references (p. 64-72).

Title from PDF of title page (University of Missouri--Columbia, viewed on Feb 26, 2010). The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file. Dissertation advisor: Dr. Barbara N. Martin. Vita. Includes bibliographical references.

Thesis (M.S.V.)--University of Toledo, 2004. / Typescript. "A thesis [submitted] as partial fulfillment of the requirements of the Master of Science degree in Civil Engineering." Includes bibliographical references (leaves 96-97).

Thesis (M. Phil.)--University of Hong Kong, 2006. / Title proper from title frame. Also available in printed format.

Thesis (Ph.D.)--University of Florida, 2005. / Title from title page of source document. Document formatted into pages; contains 112 pages. Includes vita. Includes bibliographical references.

Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisor: Randy B. Machemehl. Vita. Includes bibliographical references. Also available from UMI.

Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008. / Nemhauser,George, Committee Member ; Gu, Zonghao, Committee Member ; Ergun, Ozlem, Committee Member ; Sokol, Joel, Committee Co-Chair ; Ahmed, Shabbir, Committee Chair.

Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 36-39). Also available in electronic version.

M.Sc. (Mathematics) / In Chapter 1, we consider the relevant theory pertaining to graphs and digraphs that will be used in the study of flows in networks. Warshall’s algorithm for reachability is also considered since it will allow us to ascertain whether some paths exist in some instance. In Chapter 2, we explore flows and cuts in networks. We define the basic concepts of source, sink, intermediate vertices, capacity, costs and lower-bounds. Feasible flows are defined, as well as the value of a flow. Cuts in capacitated networks are explored and further theory relating the value of a flow and cuts is given. We considered the problem of determining a maximal flow. In particular, we consider augmentations of the flow—this allows us to give a characterization of a maximal flow. The important Max-flow Min-cut theorem is also considered. After having explored the relevant theory, we move on to methods of finding a maximal flow for a given s-t network that has a capacity on each of its arcs. Firstly, we consider zero-one and unit-capacity networks since these play a role in the applications of maximal flows in Chapter 4. We, then, compile the relevant theory and algorithms in order to implement two augmenting path finding algorithms.