Ravindra K. Ahuja
#18,707
Most Influential Person Now
Researcher and academician
Ravindra K. Ahuja's AcademicInfluence.com Rankings
Ravindra K. Ahujaengineering Degrees
Engineering
#1182
World Rank
#1796
Historical Rank
#463
USA Rank
Industrial Engineering
#11
World Rank
#12
Historical Rank
#3
USA Rank
Mechanical Engineering
#167
World Rank
#196
Historical Rank
#55
USA Rank
Applied Physics
#2522
World Rank
#2563
Historical Rank
#218
USA Rank
Download Badge
Engineering
Why Is Ravindra K. Ahuja Influential?
(Suggest an Edit or Addition)According to Wikipedia, Ravindra K. Ahuja is an Indian-born American computer scientist and entrepreneur. He is currently Professor of Industrial and Systems Engineering at the University of Florida in Gainesville, Florida, and CEO of the automation and optimization solutions provider Optym, which he founded in 2000 as Innovative Scheduling, Inc.
Ravindra K. Ahuja's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Network flows - theory, algorithms and applications (1993) (7664)
- Network Flows (2011) (1116)
- A survey of very large-scale neighborhood search techniques (2002) (694)
- Faster algorithms for the shortest path problem (1990) (553)
- Inverse Optimization (2001) (450)
- A greedy genetic algorithm for the quadratic assignment problem (2000) (390)
- Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem (2007) (210)
- Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems (2009) (203)
- A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems (2006) (186)
- A novel linear programming approach to fluence map optimization for intensity modulated radiation therapy treatment planning. (2003) (182)
- A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation (2005) (172)
- Improved Algorithms for Bipartite Network Flow (1994) (166)
- A Fast and Simple Algorithm for the Maximum Flow Problem (2011) (153)
- Improved Time Bounds for the Maximum Flow Problem (2018) (148)
- Solving Real-Life Railroad Blocking Problems (2007) (145)
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem (2001) (143)
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (2004) (131)
- Finding minimum-cost flows by double scaling (2015) (128)
- Solving Real-Life Locomotive-Scheduling Problems (2005) (125)
- Solving the Convex Cost Integer Dual Network Flow Problem (1999) (116)
- Dynamic shortest paths minimizing travel times and costs (2001) (116)
- Applications of network optimization (1992) (108)
- New scaling algorithms for the assignment and minimum mean cycle problems (1992) (105)
- Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning (2008) (100)
- Network Models in Railroad Planning and Scheduling (2005) (94)
- Computational investigations of maximum flow algorithms (1997) (92)
- Very Large-Scale Neighborhood Search (2000) (82)
- Combinatorial algorithms for inverse network flow problems (2002) (77)
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem (2003) (77)
- A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints (2001) (77)
- Solving Inverse Spanning Tree Problems Through Network Flow Techniques (1999) (71)
- Exact and Heuristic Methods for the Weapon Target Assignment Problem (2003) (70)
- Real-life locomotive planning: New formulations and computational results (2008) (65)
- A Faster Algorithm for the Inverse Spanning Tree Problem (2000) (63)
- Multicommodity network flow approach to the railroad crew-scheduling problem (2007) (62)
- The Locomotive Routing Problem (2008) (59)
- A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy (2005) (59)
- New scaling algorithms for the assignment and minimum cycle mean problems (1988) (55)
- Algorithms for the minimax transportation problem (1986) (54)
- Some Recent Advances in Network Flows (1991) (53)
- New approaches for solving the block-to-train assignment problem (2008) (48)
- A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints (2007) (47)
- Minimum cost-reliability ratio path problem (1988) (45)
- Distance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems (1991) (45)
- Use of Representative Operation Counts in Computational Testing of Algorithms (1996) (45)
- A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem (2004) (44)
- A capacity scaling algorithm for the constrained maximum flow problem (1995) (43)
- A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model (2007) (43)
- Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem (2002) (42)
- Algorithms for the Simple Equal Flow Problem (1999) (41)
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights (2002) (40)
- Chapter IV Network flows (1989) (39)
- The Scaling Network Simplex Algorithm (1992) (39)
- Minimax linear programming problem (1985) (37)
- New neighborhood search structures for the capacitated minimum spanning tree problem (1998) (36)
- Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem (1987) (35)
- Chapter 1 Applications of network optimization (1995) (33)
- New approaches for solving the block‐to‐train assignment problem (2008) (33)
- New polynomial-time cycle-canceling algorithms for minimum cost flows (2000) (30)
- Inverse Optimization, Part I: Linear Programming and General Problem (1998) (29)
- Incremental Network Optimization: Theory and Algorithms (2009) (28)
- A network flow algorithm to minimize beam‐on time for unconstrained multileaf collimator problems in cancer radiation therapy (2005) (27)
- Developing Fitter Genetic Algorithms (1997) (25)
- New polynomial-time cycle-canceling algorithms for minimum-cost flows (2000) (24)
- Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time (2008) (23)
- A neighborhood search algorithm for the combined through and fleet assignment model with time windows (2004) (20)
- Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem (2005) (20)
- A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem (2004) (20)
- Solving the Curfew Planning Problem (2010) (20)
- The balanced linear programming problem (1997) (20)
- A network simplex algorithm with O(n) consecutive degenerate pivots (2002) (20)
- Diagnosing infeasibilities in network flow problems (1998) (19)
- Spreadsheet-Based Decision Support Systems (2008) (19)
- A parametric algorithm for convex cost network flow and related problems (1984) (18)
- Optimal network configuration and capacity expansion of railroads (2008) (17)
- OR Models in Freight Railroad Industry (2011) (17)
- New distance-directed algorithms for maximum flow and parametric maximum flow problems (1987) (15)
- Integer programming based solution approaches for the train dispatching problem (2010) (15)
- Iterative algorithms for the curfew planning problem (2011) (14)
- Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications (2010) (13)
- Solving Multi-Criteria Through-Fleet Assignment Models (2003) (12)
- Maximum Flow Problem (2009) (12)
- Very Large-Scale Neighborhood Search in Airline Fleet Scheduling (2002) (11)
- Crew Scheduling Problem (2015) (10)
- Optimal expansion of capacitated transshipment networks (1996) (10)
- Combinatorial Optimization with Rational Objective Functions: A Communication (1983) (10)
- New lower planes for the network design problem (1987) (9)
- A Simulation/Optimization Framework for Locomotive Planning (2007) (9)
- Very large-scale neighborhood search : Theory , algorithms and applications (2008) (8)
- Minimum time and minimum cost path problems in street networks with traffic lights (1999) (6)
- Minimum Cost Flow Problem (2009) (5)
- Railroad Crew Scheduling (2009) (5)
- A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem (1998) (5)
- Minimum Cost Flows (2011) (5)
- Single-machine scheduling with stepwise tardiness costs and release times (2011) (5)
- Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems (2011) (4)
- A new pivot selection rule for the network simplex algorithm (1997) (4)
- Making the Empire a Thinkable Whole: Master and Servant Law in Transterritorial Perspective (2007) (4)
- Shortest Path Problem Algorithms (2011) (4)
- Locomotive Scheduling Problem (2015) (4)
- Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications (2018) (4)
- Minimizing Beam-On Time in Radiation Treatment using Network Flows (2002) (4)
- Equivalence of the primal and dual simplex algorithms for the maximum flow problem (1997) (3)
- Fast Infeasibility Detection Algorithms for Dial-A-Ride Transit Problems (1998) (3)
- Solving the Convex Ordered Set Problem with Applications to Isotone Regression (3)
- Networks And Flows (1999) (3)
- Network flow approaches in railroad planning and scheduling (2005) (2)
- Special issue of Networks on optimization in scheduled transportation networks (2011) (2)
- Solving the convex ordered set problem (1997) (2)
- THE CONSTRAINED MAXIMUM FLOW PROBLEM (1981) (1)
- Inverse Spanning Tree Problems: Formulations and Algorithms (2011) (1)
- ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, November 15-16, 2007, Sevilla, Spain (2007) (1)
- Next generation algorithms for railroad crew and locomotive scheduling (2007) (1)
- Ravindra K. Ahuja (2020) (1)
- Sloan School of Management Working Paper 4389-02 April 2002 SOLVING REAL-LIFE LOCOMOTIVE SCHEDULING PROBLEMS (2002) (1)
- Instructor's or course coordinator's name (2009) (1)
- Service Quality Management in Hospitality and Tourism (2016) (1)
- The Age of the ‘Lascar’ (2013) (1)
- Minimum Spanning Trees (2011) (1)
- Weapon Target Assignment Problem (2003) (1)
- A polynomial-time algorithm for message routing in hierarchical communication networks (1995) (0)
- ATMOS 2006 — Abstracts Collection 6 th Workshop on Algorithmic Methods and Models for Optimization of Railways (2006) (0)
- M4 1 4 No.2.o>4f- *^^ Working Paper Alfred P. Sloan School of Management Finding Minimum-cost Flows Hy Double Scaling Finding Minimum-cost Flows I$y Double Scaling Finding Minimum-cost Flows by Double Scaling (2008) (0)
- ATMOS 2007 Abstracts Collection - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (2007) (0)
- Chapter 13 SOLVING MULTI-CRITERIA THROUGH-FLEET ASSIGNMENT MODELS (2002) (0)
- New Advances in Solving the Weapon–Target Assignment Problem (2009) (0)
- Lower bounding techniques for the degree‐constrained network design problem (2009) (0)
- Railroad Locomotive Scheduling (2009) (0)
- ATMOS 2007 Preface - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (2007) (0)
- Notes on contributors (2007) (0)
- Special Issue (2021) (0)
- Computational Investigations of Flow Algorithms by Ravindra (0)
- PROEDURE FOR AUTOMATA COMPLEXITY FOR (2014) (0)
- Maximum Flow Algorithms (2011) (0)
- Selected Papers from the 7 th Workshop on Algorithmic Approaches for Transportation Modeling , Optimization , and Systems (2007) (0)
- For Peer Review Incremental Network Optimization: Theory & Algorithms (2007) (0)
- Lower bounding techniques for the degree-constrained network design problem (2009) (0)
This paper list is powered by the following services:
Other Resources About Ravindra K. Ahuja
What Schools Are Affiliated With Ravindra K. Ahuja?
Ravindra K. Ahuja is affiliated with the following schools:
