Applications of Maximal Network Flow Problems in Transportation and Assignment Problems
- Vinai Singh
- Indu Tripathi
- Nimisha Nimisha
Abstract
This paper presents some modifications of Ford-Fulkerson’s labeling method for solving the maximal network flow problem
with application in solving the transportation and assignment problems. The modifications involve the tree representation
of the nodes labeled and the edges used them. It is shown that after each flow adjustment some of the labels can
be retained for the next labeling process. Through certain computational aspects it has been suggested that to indicate
that with theses the primal-dual approach for solving the transportation and assignment problems is improved to certain
extent.
- Full Text:
PDF
- DOI:10.5539/jmr.v2n1p28
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org