The SCEAS System
| |||||||

## Search the dblp DataBase
Ravindra K. Ahuja:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
**Solving the Convex Cost Integer Dual Network Flow Problem.**[Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:31-44 [Conf] - Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
**A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:39, n:3, pp:189-208 [Journal] - Ravindra K. Ahuja
**Minimum cost-reliability ratio path problem.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1988, v:15, n:1, pp:83-89 [Journal] - Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari
**A greedy genetic algorithm for the quadratic assignment problem.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2000, v:27, n:10, pp:917-934 [Journal] - Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
**A survey of very large-scale neighborhood search techniques.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:75-102 [Journal] - Ravindra K. Ahuja, Claudio B. Cunha
**Very Large-Scale Neighborhood Search for the**[Citation Graph (0, 0)][DBLP]*K*-Constraint Multiple Knapsack Problem. J. Heuristics, 2005, v:11, n:5-6, pp:465-481 [Journal] - Ravindra K. Ahuja, James B. Orlin
**Developing Fitter Genetic Algorithms.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 1997, v:9, n:3, pp:251-253 [Journal] - Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan
**Faster Algorithms for the Shortest Path Problem**[Citation Graph (0, 0)][DBLP] J. ACM, 1990, v:37, n:2, pp:213-223 [Journal] - Ravindra K. Ahuja, James B. Orlin
**A Faster Algorithm for the Inverse Spanning Tree Problem.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:1, pp:177-193 [Journal] - Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin
**Diagnosing infeasibilities in network flow problems.**[Citation Graph (0, 0)][DBLP] Math. Program., 1998, v:81, n:, pp:263-280 [Journal] - Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin, Robert Endre Tarjan
**Finding minimum-cost flows by double scaling.**[Citation Graph (0, 0)][DBLP] Math. Program., 1992, v:53, n:, pp:243-266 [Journal] - James B. Orlin, Ravindra K. Ahuja
**New scaling algorithms for the assignment and minimum mean cycle problems.**[Citation Graph (0, 0)][DBLP] Math. Program., 1992, v:54, n:, pp:41-56 [Journal] - P. T. Sokkalingam, Prabha Sharma, Ravindra K. Ahuja
**A new pivot selection rule for the network simplex algorithm.**[Citation Graph (0, 0)][DBLP] Math. Program., 1997, v:77, n:, pp:149-158 [Journal] - Ravindra K. Ahuja, Horst W. Hamacher
**A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy.**[Citation Graph (0, 0)][DBLP] Networks, 2005, v:45, n:1, pp:36-41 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Networks, 2004, v:44, n:2, pp:160-171 [Journal] - Ravindra K. Ahuja, James B. Orlin
**Combinatorial algorithms for inverse network flow problems.**[Citation Graph (0, 0)][DBLP] Networks, 2002, v:40, n:4, pp:181-187 [Journal] - Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà
**Dynamic shortest paths minimizing travel times and costs.**[Citation Graph (0, 0)][DBLP] Networks, 2003, v:41, n:4, pp:197-205 [Journal] - P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
**New polynomial-time cycle-canceling algorithms for minimum-cost flows.**[Citation Graph (0, 0)][DBLP] Networks, 2000, v:36, n:1, pp:53-63 [Journal] - Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
**A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:185-194 [Journal] - Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam
**A network simplex algorithm with O(**[Citation Graph (0, 0)][DBLP]*n*) consecutive degenerate pivots. Oper. Res. Lett., 2002, v:30, n:3, pp:141-148 [Journal] - Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan
**Improved Algorithms for Bipartite Network Flow.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:5, pp:906-933 [Journal] - Ravindra K. Ahuja, James B. Orlin, Robert Endre Tarjan
**Improved Time Bounds for the Maximum Flow Problem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:5, pp:939-954 [Journal] **A Simulation/Optimization Framework for Locomotive Planning.**[Citation Graph (, )][DBLP]**ATMOS 2007 Abstracts Collection - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.**[Citation Graph (, )][DBLP]**ATMOS 2007 Preface - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |