Journal of Mathematical Sciences: Advances and Applications[1] R. Ahuja, T. Magnanti and J. Orlin, Network Flows: Theory,
Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ,
1993.
[2] R. Ahuja and J. Orlin, A faster algorithm for the inverse spanning
tree problem, Journal of Algorithms 34 (2000), 177-193.
[3] D. Burton, B. Paulleyblank and Ph. Toint, The inverse shortest
path problem with upper bounds on shortest paths costs, Network
Optimization (P. Pardalos, D. Hearn and W. Harger), Lecture Notes in
Economics, Math. Systems, Vol. 450, pp. 156-171, Springer-Verlang,
Berlin/New York, 1997.
[4] D. Burton and Ph. Toint, On an instance of the inverse shortest
path problem, Math. Programming 53 (1992), 45-61.
[5] M. Cai and X. Yang, Inverse Shortest Path Problems, Technical
Report, Institute of Systems Sciences, Academia Sinica, Beijing,
China, 1994.
[6] E. Ciurea and L. Ciupala, Sequential and parallel algorithms for
minimum flows, Journal Appl. Math. & Computing 15(1-2) (2004),
53-75.
[7] N. El-Sherbeny, Difference of convex functions optimization
methods: Algorithm of minimum-maximal network flow problem with
time-windows, International Journal of Sciences: Basic and Applied
Research 25(1) (2016), 67-81.
http://gssrr.org/index.php?journal=JournalOfBasicAn
dApplied
[8] N. El-Sherbeny, The dynamic shortest path problems of minimum cost
length time- windows and time-varying costs, International Journal of
Scientific and Innovative Mathematical Research 3(3) (2015), 47-55.
www.arcjournal.org
[9] N. El-Sherbeny, The algorithm of the time-dependent shortest path
problem with time-windows, Applied Mathematics 5(17) (2014),
2764-2770.
http://dx.doi.org/10.4236/am.2014.517264
[10] N. El-Sherbeny, Imprecision and flexible constraints in fuzzy
vehicle routing problem, American Journal of Mathematical and
Management Sciences 31 (2011), 55-71.
http://dx.doi.org/10.1080/01966324.2011.107378000
[11] N. El-Sherbeny, Minimum cost flow time-windows problem with
interval bounds and flows, Theoretical Mathematics & Applications,
Scienpress Ltd. 6 (2016), 15-32.
[12] C. Heuberger, Inverse combinatorial optimization: A survey on
problems, methods and results, Journal of Combinatorial Optimization 8
(2004), 329-361.
[13] A. Goldberg and S. Rao, Length Functions for Flow Computations,
Technical Report, NEC Research Institute, Inc., 1997.
[14] A. Goldberg and R. Tarjan, A new approach to the maximum-flow
problem, Journal of the Association for Computing Machinery 35 (1988),
921-949.
[15] D. Tuyttens, J. Teghem and N. El-Sherbeny, A Particular
Multiobjective Vehicle Routing Problem Solved by Simulated Annealing,
Lecture Notes in Economics and Mathematical Systems 535 (2004),
133-152, Springer-Verlag, Berlin, Germany.
http://dx.doi.org/10.1007/978-3-642-17144-4
[16] C. Yang, J. Zhang and Z. Ma, Inverse maximum flow and minimum cut
problems, Optimization 40 (1998), 147-170.
