## Publications

**Textbooks**

*Network Flows: Theory, Algorithms and Applications*

*Developing Spreadsheet-Based Decision Support Systems*

*Developing Web-Enabled Decision Support Systems*

**REFEREED JOURNAL PAPERS AND BOOK CHAPTERS:**

Publications after the Year 2000:

R.K. Ahuja, A. Kumar, and K.C. Jha. 2009. New advances in solving the weapon–target assignment problem. To appear in Handbook of Military Industrial Engineering, edited by Adedeji B. Badiru, Marlin U. Thomas, CRC Press.

D.S Altner, R.K. Ahuja, O. Ergun, and J.B. Orlin. 2009. Very large-scale neighborhood search. To appear in Wiley Encyclopedia of Operations Research and Management Science, edited by James J. Cochran, Wiley.

A.K. Nemani, and R.K. Ahuja. 2009. OR models in freight railroad industry. To appear in Wiley Encyclopedia of Operations Research and Management Science, edited by James J. Cochran, Wiley.

A.K. Nemani, and R.K. Ahuja. 2009. Spanning trees. To appear in Wiley Encyclopedia of Operations Research and Management Science, edited by James J. Cochran, Wiley.

A.K. Nemani, and R.K. Ahuja. 2009. Shortest path problems. To appear in Wiley Encyclopedia of Operations Research and Management Science, edited by James J. Cochran, Wiley.

B. Vaidyanathan, and R.K. Ahuja. 2009. Minimum cost flow problem. To appear in Wiley Encyclopedia of Operations Research and Management Science, edited by James J. Cochran, Wiley.

B. Vaidyanathan, and R.K. Ahuja. 2009. Multicommodity flow problem. To appear in Wiley Encyclopedia of Operations Research and Management Science, edited by James J. Cochran, Wiley.

F.Z. Sargut, and R.K. Ahuja. 2009. Maximum flow problem. To appear in Wiley Encyclopedia of Operations Research and Management Science, edited by James J. Cochran, Wiley.

D.S Altner, R.K. Ahuja, O. Ergun, and J.B. Orlin. 2009. Very large-scale neighborhood search. To appear in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, edited by E. Burke and G. Kendall, Springer.

B. Vaidyanathan, and R.K. Ahuja. 2009. Fast algorithms for specially structured minimum cost flow problems with applications. Submitted to Management Science.

A. K. Nemani, K. C. Jha, and R. K. Ahuja. 2009. The Load Planning Problem at an Intermodal Railroad Terminal. Submitted to Transportation Research B.

S. Bog, A. K. Nemani, and R. K. Ahuja. 2009. Iterative Algorithms for the Curfew Planning Problem. Submitted to Journal of the Operational Research Society.

A. K. Nemani, S. Bog, and R. K. Ahuja. 2009. Solving the Curfew Planning Problem.Submitted to Transportation Science.

O. Seref, R.K. Ahuja, and J.B. Orlin. 2009. Incremental network optimization: Theory and algorithms. To appear in Operations Research.

G. Sahin, and R.K. Ahuja. 2009. Lower bounding techniques for the degree-constrained network design problem. To appear in Networks.

A. Kumar, B. Vaidyanathan and R.K. Ahuja. 2009. Railroad Crew Scheduling. Encyclopedia of Optimization, Second Edition, edited by C.A. Floudas and P.M. Pardalos, Kluwer Academic Publishers, pp. 3227-3236.

A. Kumar, B. Vaidyanathan and R.K. Ahuja. 2009. Railroad Locomotive Scheduling. Encyclopedia of Optimization, Second Edition, edited by C.A. Floudas and P.M. Pardalos, Kluwer Academic Publishers, pp. 3236-3245.

R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 2009. The maximum flow problem. Encyclopedia of Optimization, Second Edition, edited by C.A. Floudas and P.M. Pardalos, Kluwer Academic Publishers, pp. 2009-2020.

R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 2009. The minimum cost flow problem. Encyclopedia of Optimization, Volume 3, edited by C. A. Floudas and P. Pardalos. Kluwer Academic Publishers, pp. 2095-2108.

F.Z. Sargut, R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 2009. Maximum flows. A book chapter to appear in The Handbook of Graph Algorithms and Applications, Volume I, edited by K. Thulasiraman, T. Nishizeki and G. Xue, CRC Press.

B. Vaidyanathan, R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 2009. Minimum cost flows. A book chapter to appear in The Handbook of Graph Algorithms and Applications, Volume I, edited by K. Thulasiraman, T. Nishizeki and G. Xue, CRC Press.

B. Vaidyanathan, R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 2009. Multi-commodity flows. A book chapter to appear in The Handbook of Graph Algorithms and Applications, Volume I, edited by K. Thulasiraman, T. Nishizeki and G. Xue, CRC Press.

D. Altner, R.K. Ahuja, O. Ergun, and J.B. Orlin. 2009. Very large-scale neighborhood search. A book chapter to appear in CRC Handbook of Discrete and Combinatorial Mathematics, Second Edition, K.H. Rosen (Editor-in-chief), CRC Press, New York.

B. Vaidyanathan, R.K. Ahuja, and J.B. Orlin. 2008. The locomotive routing problem. Transportation Science 42, 492-507.

R.K. Ahuja, K.C. Jha, and G. Sahin. 2008. New approaches for solving the block-to-train assignment problem. Networks 51, 48-62.

R.K. Ahuja and D.S. Hochbaum. 2008. Solving linear cost dynamic lot sizing problems in O(n log n) time. Operations Research 56, 255-261.

D. Aleman, A. Kumar, R.K. Ahuja, H.E. Romeijn, and J.F. Dempsey. 2008. Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning. Journal of Global Optimization 42, 769-784.

B. Vaidyanathan, R.K. Ahuja, J. Liu, and L.A. Shughart. 2008. Real-life locomotive planning: New formulations, algorithms and computational results. Transportation Research B 42, 147-168.

R.K. Ahuja, W. Huang, H.E. Romeijn, and D. Romero Morales. 2007. A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints. INFORMS Journal on Computing 19, 14-26.

R.K. Ahuja, K.C. Jha, and J. Liu. 2007. Solving real-life railroad blocking problems. Interfaces 37, 404-419.

R.K. Ahuja, A. Kumar, and K.C. Jha. 2007. Exact and heuristic algorithms for the weapon-target assignment problem. Operations Research 55, 1136-1146.

R.K. Ahuja, J. Goodstein, A. Mukherjee, J.B. Orlin, and D. Sharma. 2007. A very large-scale neighborhood search algorithm for the combined through-fleet assignment model. INFORMS Journal on Computing 19, 646-657.

B. Vaidyanathan, K.C. Jha, and R.K. Ahuja. 2007. Network flow-based approaches for the railroad crew scheduling problem. IBM Journal of Research & Development 51, 325-344.

M.M.H. Seref and R.K. Ahuja. 2007. Spreadsheet-based decision support systems. Chapter 14 in the book Handbook on Decision Support Systems, edited by F. Burstein and C.W. Holsapple, Springer Verlag, pp. 277-298.

J. Liu, R.K. Ahuja, and G. Sahin. 2007. Optimal network configuration and capacity expansion of railroads. Journal of the Operational Research Society, 1-10.

R.K. Ahuja, K.C. Jha, J.B. Orlin, and D. Sharma. 2007. A very large-scale neighborhood search algorithm for the quadratic assignment problem. INFORMS Journal on Computing 19, 646-657.

R.K. Ahuja, O. Ergun, J.B. Orlin, and A.P. Punnen. 2007. Very large-scale neighborhood search. A chapter in the book “Approximation Algorithms and Metaheuristics,” edited by T.F. Gonzalez, Chapman & Hall, pp. 20-1 to 20-12.

H.E. Romeijn, R.K. Ahuja, J.F. Dempsey, and A. Kumar. 2006. A new linear programming approach to radiation therapy treatment planning problems. Operations Research 54, 201-216.

R.K. Ahuja, C.B. Cunha, and G. Sahin. 2005. Networks models in railroad planning and scheduling. A chapter in the book entitled “Tutorials in Operations Research”, Vol. 1, pp. 54-101.

R.K. Ahuja and H. Hamacher. 2005. A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. Networks 45, 36-41.

R.K. Ahuja, J. Liu, A. Mukherjee, J.B. Orlin, D. Sharma, and L.A. Shughart. 2005. Solving real-life locomotive scheduling problems. Transportation Science 39, 503-517.

H.E. Romeijn, R.K. Ahuja, J.F. Dempsey, and A. Kumar. 2005. A column generation approach to radiation therapy treatment planning using aperture modulation. SIAM Journal on Optimization 15, 838-862.

C.B. Cunha and R.K. Ahuja. 2005. Very large scale neighborhood search for the K-constrained multiple knapsack problem. Journal of Heuristics 11, 465-481.

R.K. Ahuja, J.B. Orlin, S. Pallottino, M.P. Scaparra, and M.G. Scutella. 2004. A multi-exchange heuristic for the single source capacitated facility location. Management Science 50, 749-760.

R.K. Ahuja and M.M. Hanna. 2004. Decision support systems development: An essential part of OR education. Operations Research Letters 31, April Issue, 12-13.

R.K. Ahuja, J. Goodstein, J. Liu, A. Mukherjee, and J.B. Orlin. 2004. Solving the combined through-fleet assignment model with time windows using neighborhood search. Networks 44, 160-171.

R.K. Ahuja, D. Hochbaum, and J.B. Orlin. 2004. A cut based algorithm for the convex dual of the minimum cost network flow problem. Algorithmica 39, 189-208.

R.K. Ahuja, J.B. Orlin, S. Pallottino, and M.G. Scutellà. 2003. Dynamic shortest paths minimizing travel times and costs. Networks 41, 197-205.

R.K. Ahuja and J.B. Orlin. 2003. Graph and network optimization. Encyclopedia of Life Support Systems, edited by U. Derigs.

R. Agarwal, R.K. Ahuja, G. Laporte, and Z.J. Shen. 2003. A composite very large-scale neighborhood search algorithm for the vehicle routing problem. Handbook of Scheduling: Algorithms, Models and Performance Analysis. Edited by J. Y-T. Leung, Chapman & Hall/CRC, pp. 49-01 to 49-23.

R.K. Ahuja, D. Hochbaum, and J.B. Orlin. 2003. Solving the convex cost integer dual network flow problem. Management Science 49, 950-964.

R.K. Ahuja, J.B. Orlin, and D. Sharma. 2003. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters 31, 185-194.

H.E. Romeijn, R.K. Ahuja, J.F. Dempsey, A. Kumar, and J. Li. 2003. A novel linear programming approach to fluence map optimization for intensity modulated radiation therapy treatment planning. Physics in Medicine and Biology 48, 3521-3542.

R.K. Ahuja, J. Liu, J. Goodstein, A. Mukherjee, J.B. Orlin, and D. Sharma. 2003. Solving multi-criteria combined through-fleet assignment models. Chapter 13 in the book Operations Research in Space and Air, Edited by Tito A. Ciriani, Giorgio Fasano, Stefano Gliozzi, and Roberto Tadei, Kluwer Academic Publishers, pp. 233-256.

R.K. Ahuja and J.B. Orlin. 2002. Combinatorial algorithms for inverse network flow problems.Networks 40, 181-187.

R.K. Ahuja, O. Ergun, J.B. Orlin, and A.P. Punnen. 2002. A survey of very large scale neighborhood search techniques. Discrete Applied Mathematics 123, 75-102.

R.K. Ahuja, J.B. Orlin, S. Pallottino, and M. Scutella. 2002. Minimum time and minimum cost path problems in street networks with traffic lights. Transportation Science 36, 326-336.

R.K. Ahuja and J.B. Orlin. 2002. Very large-scale neighborhood search for airline fleet scheduling. SIAM News, Volume 35, Number 9, November Issue.

R.K. Ahuja, J.B. Orlin, P. Sharma, and P.T. Sokkalingam. 2002. A network simplex algorithm with O(n) consecutive degenerate pivots. Operations Research Letters 30, 141-148.

R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 2002. Introduction to network optimization. Handbook of Applied Optimization, edited by M. Resende and P. Pardalos, Oxford University Press, pp. 352-362.

R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 2002. Maximum flow problem. Handbook of Applied Optimization, edited by M. Resende and P. Pardalos, Oxford University Press, pp. 363-374.

R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 2002. Minimum spanning tree problem. Handbook of Applied Optimization, edited by M. Resende and P. Pardalos, Oxford University Press, pp. 422-430.

R.K. Ahuja and J.B. Orlin. 2001. Inverse optimization. Operations Research 49, 771-783.

R.K. Ahuja and J.B. Orlin. 2001. A fast scaling algorithm for minimizing separable convex functions subject to chain constraints. Operations Research 49, 784-789.

R.K. Ahuja, J.B. Orlin, and D. Sharma. 2001. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Mathematical Programming 91, 71-97.

P.T. Sokkalingam, R.K. Ahuja, and J.B. Orlin. 2000. A new polynomial-time cycle-canceling algorithm for the minimum cost flow problem. Networks 36, 53-63.

R.K. Ahuja, and J.B. Orlin. 2000. A faster algorithm for the inverse spanning tree problem. Journal of Algorithms 34, 177-193.

J.B. Orlin, and R.K. Ahuja. 2000. Minimum spanning trees, Shortest paths, Maximum flows, Minimum cost flow. CRC Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen (Editor-in-chief), CRC Press, New York, pp. 629-633, 652-683.

R.K. Ahuja, J.B. Orlin, and A. Tiwari. 2000. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research 27, 917-934.

R.K. Ahuja, J.B. Orlin, and D. Sharma. 2000. Very large scale neighborhood search. International Transactions in Operations Research7, 301-317.

Publications before the Year 2000:

R.K. Ahuja, J.B. Orlin, P. Zuddas, and G. Secki. 1999. Algorithms for the equal flow problem. Management Science 45, 1440-1455.

P.T. Sokkalingam, R.K. Ahuja, and J.B. Orlin. 1999. Solving inverse spanning tree problems through network flow techniques. Operations Research 47, 291-300.

C.C. Aggarwal, R.K. Ahuja, J. Hao, and J.B. Orlin. 1998. Diagnosing infeasibilities in network flow problems. Mathematical Programming 81, 263-280.

P.T. Sokkalingam, P. Sharma, and R.K. Ahuja. 1997. A new pivot selection rule for the network simplex algorithm. Mathematical Programming 78, 149-158.

R.K. Ahuja. 1997. The balanced linear programming problem. European Journal of Operational Research 101, 29-38.

R.K. Ahuja and J.B. Orlin. 1997. Developing fitter genetic algorithms. ORSA Journal of Computing 7, 251-253.

R.K. Ahuja, M. Kodialam, A.K. Mishra, and J.B. Orlin. 1997. Computational investigation of maximum flow algorithms. European Journal on Operational Research 97, 509-542.

R.K. Ahuja. 1997. Paths and Flows. Annotated Bibliographies in Combinatorial Optimization: Chapter 17, John Wiley & Sons, 283-306.

R.K. Ahuja and J.B. Orlin. 1997. Equivalence of primal simplex and dual simplex algorithms for the maximum flow problem. Operations Research Letters 20, 101-108.

R.K. Ahuja, J.L. Batra, S.K. Gupta, and A.P. Punnen. 1996. Optimal expansion of capacitated transshipment networks. European Journal of Operational Research 89, 176-184.

R.K. Ahuja and J. B. Orlin. 1996. Use of representative counts in computational testing of algorithms. ORSA Journal on Computing 6, 318-330.

R.K. Ahuja, T. L. Magnanti, J. B. Orlin, and M. R. Reddy. 1995. Applications of Network Optimization. Handbooks of Operations Research and Management Science, Volume 7: Network Models, Edited by M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, Elsevier, North-Holland, Amsterdam, pp. 1-83.

R.K. Ahuja and J. B. Orlin. 1995. A capacity scaling algorithm for the constrained maximum flow problem. Networks 25, 89-98.

G.G. Polak and R. K. Ahuja. 1995. A polynomial-time algorithm for message routing in hierarchical communication networks. European Journal of Operational Research 80, 139-146.

R.K. Ahuja, J.B. Orlin, C. Stein, and R.E. Tarjan. 1994. Improved algorithms for bipartite network flows. SIAM Journal on Computing 23, 906-933.

R. K. Ahuja, A.V. Goldberg, J. B. Orlin, and R.E. Tarjan. 1992. Finding minimum-cost flows by double scaling. Mathematical Programming 53, 243-266.

R.K. Ahuja and J.B. Orlin. 1992. The scaling network simplex algorithm. Operations Research 40, S5-S13.

J.B. Orlin and R.K. Ahuja. 1992. New scaling algorithms for the assignment and minimum cycle mean problems. Mathematical Programming 54, 41-56.

R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 1991. Some recent advances in network flows. SIAM Review 33, 175-219.

J.B. Orlin and R.K. Ahuja. 1991. Distance-directed algorithms for maximum flow and parametric maximum flow problems. Naval Research Logistics 38, 413-430.

R.K. Ahuja, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan. 1990. Faster algorithms for the shortest path problem. Journal of ACM 37, 213-223.

R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. 1989. Network Flows Handbooks in Operations Research and Management Science. Vol. 1: Optimization, Edited by G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, Elsevier, North-Holland, Amsterdam, pp. 211-360.

R.K. Ahuja, J.B. Orlin, and R.E. Tarjan. 1989. Improved time bounds for the maximum flow problem. SIAM Journal of Computing 18, 939-954.

R.K. Ahuja and J.B. Orlin. 1989. A fast and simple algorithm for the maximum flow problem. Operations Research 37, 748-759.

R.K. Ahuja. 1988. Minimum cost to reliability ratio path problem. Computers and Operations Research 15, 83-89.

R.K. Ahuja and V.V.S. Murty. 1987. New lower planes for the network design problems. Networks 17, 113-127.

R.K. Ahuja and V.V.S. Murty. 1987. Exact and heuristic algorithms for the optimum communication spanning tree problem. Transportation Science 21, 163-170.

R.K. Ahuja. 1986. Algorithms for the minimax transportation problem.Naval Research Logistics Quarterly 33, 725-740.

R.K. Ahuja. 1985. Minimax linear programming problem. Operations Research Letters 4, 131-134.

R.K. Ahuja, J.L. Batra, and S.K. Gupta. 1984. A parametric algorithm for the convex cost flow and related problems. European Journal of Operational Research 16, 222-235.

R.K. Ahuja, J.L. Batra, and S.K. Gupta. 1983. Combinatorial optimization with rational objective functions: A communication. Mathematics of Operations Research 8, 314.

R.K. Ahuja, J.L. Batra, and S.K. Gupta. 1981. The constrained maximum flow problem. Scientific Management of Transport Systems, N. K. Jaiswal (Ed.), North-Holland Publishing Co., 304-316.

R.K. Ahuja and A.K. Mittal. 1981. Maximum arc-disjoint and node-disjoint flows in two-commodity networks. Opsearch 18, 92-103.

## Social links