References
- Afshari R.A., Taghizadeh K.P.S.P.H., “Maximum Dynamic Network Flow Interdiction Problem: New Formulation and Solution Procedures Original Research Article,” Computers & Industrial Engineering, Vol. 65(4), pp. 4, pp. 531–536, 2013.
- Aggarwal C.C., Kaplan H., Tarjan R.E., “A Faster Primal Network Simplex Algorithm,” Massachusetts Institute of Technology, Operations Research Centre, Working Paper, OR, 315–96, 1996.
- Ahuja R.K., Orlin T.L. J. B., Network Flows: Theory, Algorithms and Applications, Prentice Hall, 1993.
- Ahuja R.K., Orlin J.B., Sharma P., Sokkalingam P.T., “A Network Simplex Algorithm with O(N) Consecutive Degenerate Pivots,” Operations Research Letters, Vol. 30(3), pp. 141–148, 2002.
- Akturk M.S., Yilmaz M., “Scheduling of ...
Get Port Automation and Vehicle Scheduling, 3rd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
