To: Author

Article Fingerprint
ReserarchID
3Y6AB
Choose where you want to hide AI Takeaway. Your site-wide choice will be remembered in this browser.
This paper presents a procedure to solve Minimum Convex-Cost Network Flow Problems (MC-CNFP). This solution algorithm is constructed on the concepts of Network Simplex Method (NSM) for minimum cost network flow problem, Convex Simplex Method (CSM) of Zangwill, the decomposition of convex simplex method and non-linear transformation problem.
Dr. Dewan Ferdous Wahid, Farjana Habiba, Ganesh Chandra Ray. 2012. "A Solution Procedure for Minimum Convex-Cost Network Flow Problems". Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 12 (GJSFR Volume 12 Issue F10).
Crossref Journal DOI 10.17406/GJSFR
Print ISSN 0975-5896
e-ISSN 2249-4626
v1.2
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 152
Country: Bangladesh
Subject: Global Journal of Science Frontier Research
Authors: Dr. Dewan Ferdous Wahid, Farjana Habiba, Ganesh Chandra Ray (PhD/Dr. count: 1)
View Count (all-time): 312
Total Views (Real + Logic): 1743
Total Downloads (simulated): 125
Publish Date: 2012 07, Sun
Monthly Totals (Real + Logic):
We use cookies and similar technologies to improve site performance, understand traffic, and enhance your publishing experience. Cookie Policy
Choose which optional cookies Global Journals can use. Your preference applies across this platform and can be updated any time.
These cookies are required for core website functionality and security.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.