Journal of Mathematical Sciences: Advances and ApplicationsAuthor's: Nasser A. El-Sherbeny
Pages: [1] - [18]
Received Date: November 9, 2016
Submitted by:
DOI: http://dx.doi.org/10.18642/jmsaa_7100121736
In this paper, we present the inverse minimum flow problem with time-windows, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow that satisfies a time-windows constraint for each vertex in the network. A linear time and space method to decide if the problem has solution is presented. The inverse minimum flow problem with time windows has the inverse combinatorial optimization and an NP-hard problem. We propose in this work a new algorithm for solving the ‘inverse minimum flow problem with time-windows’ (IMFPTW).
inverse combinatorial optimization, optimization network, minimum flow, graph search, time-windows.
