@article{ajams2019761,
author={El-Sherbeny, Nasser A.},
title={The Fuzzy Minimum Cost Flow Problem with the Fuzzy Time-Windows},
journal={American Journal of Applied Mathematics and Statistics},
volume={7},
number={6},
pages={191--195},
year={2019},
url={http://pubs.sciepub.com/ajams/7/6/1},
issn={2328-7292},
abstract={The Minimum Cost Flow Problem (MCFP) is a well-known combinatorial optimization and a logical distribution problem. The MCFP is an NP-hard problem with many applications in logistic networks and computer networks.** **The Fuzzy Minimum Cost Flow Problem with Fuzzy Time-Windows (FMCFPFTW) is an extension of the MCFP. The goal of the problem is to find the minimum amount of the fuzzy flow from the source to the sink that satisfies all constraints of the fuzzy shortest dynamic f-augmenting path with the fuzzy dynamic residual network. We consider a generalized fuzzy version of the MCFP of the fuzzy network. We propose the mathematical model of the FMCFPFTW. Finally, a new algorithm of the FMCFPFTW is presented.},
doi={10.12691/ajams-7-6-1}
publisher={Science and Education Publishing}
}