Flow in Networks

Asoke Kumar Bhunia (), Laxminarayan Sahoo () and Ali Akbar Shaikh ()
Additional contact information
Asoke Kumar Bhunia: The University of Burdwan
Laxminarayan Sahoo: Raniganj Girls’ College
Ali Akbar Shaikh: The University of Burdwan

Chapter Chapter 16 in Advanced Optimization and Operations Research, 2019, pp 487-519 from Springer

Abstract: Abstract The objectives of this chapter are to: Present ideas on graphs and their properties Study flow and potential in networks Discuss the solution procedure of a minimum path problem when all arc lengths are either non-negative or unrestricted in sign Present ideas on network flow, maximum flow problems and generalized maximum flow problems Discuss the source, the sink of a flow, the cut and its capacity in a network flow problem and also the proof of the max-flow min-cut theorem Discuss the solution procedure of maximum flow problems Derive the LPP formulation of a network.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-981-32-9967-2_16

Ordering information: This item can be ordered from
http://www.springer.com/9789813299672

DOI: 10.1007/978-981-32-9967-2_16

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().