Minimum cost-reliability ratio path problem. - Ravindra K. Ahuja (Comput. Oper. Res., 1988)

A Fast and Simple Algorithm for the Maximum Flow Problem. - Ravindra K. Ahuja; James B. Orlin (Oper. Res., 1989)

Improved Time Bounds for the Maximum Flow Problem. - Ravindra K. Ahuja; James B. Orlin; Robert Endre Tarjan (SIAM J. Comput., 1989)

Faster Algorithms for the Shortest Path Problem - Ravindra K. Ahuja; Kurt Mehlhorn; James B. Orlin; Robert Endre Tarjan (J. ACM, 1990)

Some Recent Advances in Network Flows. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (SIAM Rev., 1991)

The Scaling Network Simplex Algorithm. - Ravindra K. Ahuja; James B. Orlin (Oper. Res., 1992)

Finding minimum-cost flows by double scaling. - Ravindra K. Ahuja; Andrew V. Goldberg; James B. Orlin; Robert Endre Tarjan (Math. Program., 1992)

New scaling algorithms for the assignment and minimum mean cycle problems. - James B. Orlin; Ravindra K. Ahuja (Math. Program., 1992)

Network flows - theory, algorithms and applications. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Prentice Hall, 1993)

Improved Algorithms for Bipartite Network Flow. - Ravindra K. Ahuja; James B. Orlin; Clifford Stein 001; Robert Endre Tarjan (SIAM J. Comput., 1994)

A capacity scaling algorithm for the constrained maximum flow problem. - Ravindra K. Ahuja; James B. Orlin (Networks, 1995)

Use of Representative Operation Counts in Computational Testing of Algorithms. - Ravindra K. Ahuja; James B. Orlin (INFORMS J. Comput., 1996)

Developing Fitter Genetic Algorithms. - Ravindra K. Ahuja; James B. Orlin (INFORMS J. Comput., 1997)

A new pivot selection rule for the network simplex algorithm. - P. T. Sokkalingam; Prabha Sharma; Ravindra K. Ahuja (Math. Program., 1997)

Equivalence of the primal and dual simplex algorithms for the maximum flow problem. - Ravindra K. Ahuja; James B. Orlin (Oper. Res. Lett., 1997)

Diagnosing infeasibilities in network flow problems. - Charu C. Aggarwal; Ravindra K. Ahuja; Jianxiu Hao; James B. Orlin (Math. Program., 1998)

Solving Inverse Spanning Tree Problems Through Network Flow Techniques. - P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin (Oper. Res., 1999)

Networks And Flows. - James B. Orlin; Ravindra K. Ahuja; David Simchi-Levi; Sunil Chopra; Bruce L. Golden; B. K. Kaku (Handbook of Discrete and Combinatorial Mathematics, 1999)

A greedy genetic algorithm for the quadratic assignment problem. - Ravindra K. Ahuja; James B. Orlin; Ashish Tiwari 001 (Comput. Oper. Res., 2000)

A Faster Algorithm for the Inverse Spanning Tree Problem. - Ravindra K. Ahuja; James B. Orlin (J. Algorithms, 2000)

New polynomial-time cycle-canceling algorithms for minimum-cost flows. - P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin (Networks, 2000)

Inverse Optimization. - Ravindra K. Ahuja; James B. Orlin (Oper. Res., 2001)

A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints. - Ravindra K. Ahuja; James B. Orlin (Oper. Res., 2001)

Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. - Ravindra K. Ahuja; James B. Orlin; Dushyant Sharma (Math. Program., 2001)

A survey of very large-scale neighborhood search techniques. - Ravindra K. Ahuja; Özlem Ergun; James B. Orlin; Abraham P. Punnen (Discret. Appl. Math., 2002)

Combinatorial algorithms for inverse network flow problems. - Ravindra K. Ahuja; James B. Orlin (Networks, 2002)

A network simplex algorithm with O(n) consecutive degenerate pivots. - Ravindra K. Ahuja; James B. Orlin; Prabha Sharma; P. T. Sokkalingam (Oper. Res. Lett., 2002)

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights. - Ravindra K. Ahuja; James B. Orlin; Stefano Pallottino; Maria Grazia Scutellà (Transp. Sci., 2002)

Solving the Convex Cost Integer Dual Network Flow Problem. - Ravindra K. Ahuja; Dorit S. Hochbaum; James B. Orlin (Manag. Sci., 2003)

Dynamic shortest paths minimizing travel times and costs. - Ravindra K. Ahuja; James B. Orlin; Stefano Pallottino; Maria Grazia Scutellà (Networks, 2003)

A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. - Ravindra K. Ahuja; James B. Orlin; Dushyant Sharma (Oper. Res. Lett., 2003)

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. - Ravindra K. Ahuja; Dorit S. Hochbaum; James B. Orlin (Algorithmica, 2004)

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem. - Ravindra K. Ahuja; James B. Orlin; Stefano Pallottino; Maria Paola Scaparra; Maria Grazia Scutellà (Manag. Sci., 2004)

A neighborhood search algorithm for the combined through and fleet assignment model with time windows. - Ravindra K. Ahuja; Jian Liu; James B. Orlin; Jon Goodstein; Amit Mukherjee (Networks, 2004)

A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem. - Richa Agarwal 001; Ravindra K. Ahuja; Gilbert Laporte; Zuo-Jun Max Shen (Handbook of Scheduling, 2004)

Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem. - Ravindra K. Ahuja; Claudio Barbieri da Cunha (J. Heuristics, 2005)

A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. - Ravindra K. Ahuja; Horst W. Hamacher (Networks, 2005)

A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation. - H. Edwin Romeijn; Ravindra K. Ahuja; James F. Dempsey; Arvind Kumar (SIAM J. Optim., 2005)

Solving Real-Life Locomotive-Scheduling Problems. - Ravindra K. Ahuja; Jian Liu; James B. Orlin; Dushyant Sharma; Larry A. Shughart (Transp. Sci., 2005)

A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems. - H. Edwin Romeijn; Ravindra K. Ahuja; James F. Dempsey; Arvind Kumar (Oper. Res., 2006)

ATMOS 2007 Abstracts Collection - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. - Ravindra K. Ahuja; Christian Liebchen; Juan A. Mesa (ATMOS, 2007)

ATMOS 2007 Preface - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. - Ravindra K. Ahuja; Christian Liebchen; Juan A. Mesa (ATMOS, 2007)

A Simulation/Optimization Framework for Locomotive Planning. - Artyom G. Nahapetyan; Ravindra K. Ahuja; F. Zeynep Sargut; Andy John; Kamalesh Somani (ATMOS, 2007)

Multicommodity network flow approach to the railroad crew-scheduling problem. - Balachandran Vaidyanathan; Krishna C. Jha; Ravindra K. Ahuja (IBM J. Res. Dev., 2007)

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model. - Ravindra K. Ahuja; Jon Goodstein; Amit Mukherjee; James B. Orlin; Dushyant Sharma (INFORMS J. Comput., 2007)

A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints. - Ravindra K. Ahuja; Wei Huang; H. Edwin Romeijn; Dolores Romero Morales (INFORMS J. Comput., 2007)

Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem. - Ravindra K. Ahuja; Krishna C. Jha; James B. Orlin; Dushyant Sharma (INFORMS J. Comput., 2007)

Solving Real-Life Railroad Blocking Problems. - Ravindra K. Ahuja; Krishna C. Jha; Jian Liu (Interfaces, 2007)

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem. - Ravindra K. Ahuja; Arvind Kumar; Krishna C. Jha; James B. Orlin (Oper. Res., 2007)

Very Large-Scale Neighborhood Search. - Özlem Ergun; Abraham P. Punnen; James B. Orlin; Ravindra K. Ahuja (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time. - Ravindra K. Ahuja; Dorit S. Hochbaum (Oper. Res., 2008)

Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning. - Dionne M. Aleman; Arvind Kumar; Ravindra K. Ahuja; H. Edwin Romeijn; James F. Dempsey (J. Glob. Optim., 2008)

Optimal network configuration and capacity expansion of railroads. - Jian Liu; Ravindra K. Ahuja; Güvenç Sahin (J. Oper. Res. Soc., 2008)

New approaches for solving the block-to-train assignment problem. - Krishna C. Jha; Ravindra K. Ahuja; Güvenç Sahin (Networks, 2008)

The Locomotive Routing Problem. - Balachandran Vaidyanathan; Ravindra K. Ahuja; James B. Orlin (Transp. Sci., 2008)

Incremental Network Optimization: Theory and Algorithms. - Onur Seref; Ravindra K. Ahuja; James B. Orlin (Oper. Res., 2009)

Lower bounding techniques for the degree-constrained network design problem. - Güvenç Sahin; Ravindra K. Ahuja (Networks, 2009)

Maximum Flow Problem. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Encyclopedia of Optimization, 2009)

Minimum Cost Flow Problem. - Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin (Encyclopedia of Optimization, 2009)

Railroad Locomotive Scheduling. - Arvind Kumar; Balachandran Vaidyanathan; Ravindra K. Ahuja (Encyclopedia of Optimization, 2009)

Railroad Crew Scheduling. - Arvind Kumar; Balachandran Vaidyanathan; Krishna C. Jha; Ravindra K. Ahuja (Encyclopedia of Optimization, 2009)

Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications. - Balachandran Vaidyanathan; Ravindra K. Ahuja (Oper. Res., 2010)

Solving the Curfew Planning Problem. - Ashish K. Nemani; Suat Bog; Ravindra K. Ahuja (Transp. Sci., 2010)

Iterative algorithms for the curfew planning problem. - Suat Bog; Ashish K. Nemani; Ravindra K. Ahuja (J. Oper. Res. Soc., 2011)

Special issue of Networks on optimization in scheduled transportation networks. - Ravindra K. Ahuja; Christian Liebchen (Networks, 2011)

Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications. - Ravindra K. Ahuja; Özlem Ergun; James B. Orlin; Abraham P. Punnen (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)