| 2009 |
|---|
| 33 | EE | Ravindra K. Ahuja,
Thomas L. Magnanti,
James B. Orlin:
Maximum Flow Problem.
Encyclopedia of Optimization 2009: 2009-2020 |
| 32 | EE | Ravindra K. Ahuja,
Thomas L. Magnanti,
James B. Orlin:
Minimum Cost Flow Problem.
Encyclopedia of Optimization 2009: 2095-2108 |
| 31 | EE | Arvind Kumar,
Balachandran Vaidyanathan,
Krishna C. Jha,
Ravindra K. Ahuja:
Railroad Crew Scheduling.
Encyclopedia of Optimization 2009: 3227-3236 |
| 30 | EE | Arvind Kumar,
Balachandran Vaidyanathan,
Ravindra K. Ahuja:
Railroad Locomotive Scheduling.
Encyclopedia of Optimization 2009: 3236-3245 |
| 29 | EE | Güvenç Sahin,
Ravindra K. Ahuja:
Lower bounding techniques for the degree-constrained network design problem.
Networks 53(4): 334-344 (2009) |
| 2008 |
|---|
| 28 | EE | Krishna C. Jha,
Ravindra K. Ahuja,
Güvenç Sahin:
New approaches for solving the block-to-train assignment problem.
Networks 51(1): 48-62 (2008) |
| 2007 |
|---|
| 27 | | Christian Liebchen,
Ravindra K. Ahuja,
Juan A. Mesa:
ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, November 15-16, 2007, Sevilla, Spain
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 26 | EE | Artyom G. Nahapetyan,
Ravindra K. Ahuja,
F. Zeynep Sargut,
Andy John,
Kamalesh Somani:
A Simulation/Optimization Framework for Locomotive Planning.
ATMOS 2007 |
| 25 | EE | Ravindra K. Ahuja,
Christian Liebchen,
Juan A. Mesa:
ATMOS 2007 Abstracts Collection - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
ATMOS 2007 |
| 24 | EE | Ravindra K. Ahuja,
Christian Liebchen,
Juan A. Mesa:
ATMOS 2007 Preface - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
ATMOS 2007 |
| 23 | EE | Balachandran Vaidyanathan,
Krishna C. Jha,
Ravindra K. Ahuja:
Multicommodity network flow approach to the railroad crew-scheduling problem.
IBM Journal of Research and Development 51(3/4): 325-344 (2007) |
| 2005 |
|---|
| 22 | EE | Ravindra K. Ahuja,
Claudio B. Cunha:
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem.
J. Heuristics 11(5-6): 465-481 (2005) |
| 21 | EE | Ravindra K. Ahuja,
Horst W. Hamacher:
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy.
Networks 45(1): 36-41 (2005) |
| 2004 |
|---|
| 20 | EE | Ravindra K. Ahuja,
Dorit S. Hochbaum,
James B. Orlin:
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
Algorithmica 39(3): 189-208 (2004) |
| 19 | EE | Ravindra K. Ahuja,
Jian Liu,
James B. Orlin,
Jon Goodstein,
Amit Mukherjee:
A neighborhood search algorithm for the combined through and fleet assignment model with time windows.
Networks 44(2): 160-171 (2004) |
| 2003 |
|---|
| 18 | EE | Ravindra K. Ahuja,
James B. Orlin,
Stefano Pallottino,
Maria Grazia Scutellà:
Dynamic shortest paths minimizing travel times and costs.
Networks 41(4): 197-205 (2003) |
| 17 | EE | Ravindra K. Ahuja,
James B. Orlin,
Dushyant Sharma:
A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
Oper. Res. Lett. 31(3): 185-194 (2003) |
| 2002 |
|---|
| 16 | | Ravindra K. Ahuja,
Özlem Ergun,
James B. Orlin,
Abraham P. Punnen:
A survey of very large-scale neighborhood search techniques.
Discrete Applied Mathematics 123(1-3): 75-102 (2002) |
| 15 | EE | Ravindra K. Ahuja,
James B. Orlin:
Combinatorial algorithms for inverse network flow problems.
Networks 40(4): 181-187 (2002) |
| 14 | EE | Ravindra K. Ahuja,
James B. Orlin,
Prabha Sharma,
P. T. Sokkalingam:
A network simplex algorithm with O(n) consecutive degenerate pivots.
Oper. Res. Lett. 30(3): 141-148 (2002) |
| 2000 |
|---|
| 13 | EE | Ravindra K. Ahuja,
James B. Orlin,
Ashish Tiwari:
A greedy genetic algorithm for the quadratic assignment problem.
Computers & OR 27(10): 917-934 (2000) |
| 12 | | Ravindra K. Ahuja,
James B. Orlin:
A Faster Algorithm for the Inverse Spanning Tree Problem.
J. Algorithms 34(1): 177-193 (2000) |
| 11 | EE | P. T. Sokkalingam,
Ravindra K. Ahuja,
James B. Orlin:
New polynomial-time cycle-canceling algorithms for minimum-cost flows.
Networks 36(1): 53-63 (2000) |
| 1999 |
|---|
| 10 | EE | Ravindra K. Ahuja,
Dorit S. Hochbaum,
James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem.
IPCO 1999: 31-44 |
| 1998 |
|---|
| 9 | | Charu C. Aggarwal,
Ravindra K. Ahuja,
Jianxiu Hao,
James B. Orlin:
Diagnosing infeasibilities in network flow problems.
Math. Program. 81: 263-280 (1998) |
| 1997 |
|---|
| 8 | EE | Ravindra K. Ahuja,
James B. Orlin:
Developing Fitter Genetic Algorithms.
INFORMS Journal on Computing 9(3): 251-253 (1997) |
| 7 | | P. T. Sokkalingam,
Prabha Sharma,
Ravindra K. Ahuja:
A new pivot selection rule for the network simplex algorithm.
Math. Program. 77: 149-158 (1997) |
| 1994 |
|---|
| 6 | | Ravindra K. Ahuja,
James B. Orlin,
Clifford Stein,
Robert Endre Tarjan:
Improved Algorithms for Bipartite Network Flow.
SIAM J. Comput. 23(5): 906-933 (1994) |
| 1992 |
|---|
| 5 | | Ravindra K. Ahuja,
Andrew V. Goldberg,
James B. Orlin,
Robert Endre Tarjan:
Finding minimum-cost flows by double scaling.
Math. Program. 53: 243-266 (1992) |
| 4 | | James B. Orlin,
Ravindra K. Ahuja:
New scaling algorithms for the assignment and minimum mean cycle problems.
Math. Program. 54: 41-56 (1992) |
| 1990 |
|---|
| 3 | EE | Ravindra K. Ahuja,
Kurt Mehlhorn,
James B. Orlin,
Robert Endre Tarjan:
Faster Algorithms for the Shortest Path Problem
J. ACM 37(2): 213-223 (1990) |
| 1989 |
|---|
| 2 | | Ravindra K. Ahuja,
James B. Orlin,
Robert Endre Tarjan:
Improved Time Bounds for the Maximum Flow Problem.
SIAM J. Comput. 18(5): 939-954 (1989) |
| 1988 |
|---|
| 1 | EE | Ravindra K. Ahuja:
Minimum cost-reliability ratio path problem.
Computers & OR 15(1): 83-89 (1988) |
