Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2009 | ||
---|---|---|

47 | Ravindra K. Ahuja, Rolf H. Möhring, Christos D. Zaroliagis: Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems Springer 2009 | |

46 | Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin: Maximum Flow Problem. Encyclopedia of Optimization 2009: 2009-2020 | |

45 | Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin: Minimum Cost Flow Problem. Encyclopedia of Optimization 2009: 2095-2108 | |

44 | Arvind Kumar, Balachandran Vaidyanathan, Krishna C. Jha, Ravindra K. Ahuja: Railroad Crew Scheduling. Encyclopedia of Optimization 2009: 3227-3236 | |

43 | Arvind Kumar, Balachandran Vaidyanathan, Ravindra K. Ahuja: Railroad Locomotive Scheduling. Encyclopedia of Optimization 2009: 3236-3245 | |

42 | Güvenç Sahin, Ravindra K. Ahuja: Lower bounding techniques for the degree-constrained network design problem. Networks 53(4): 334-344 (2009) | |

41 | Onur Seref, Ravindra K. Ahuja, James B. Orlin: Incremental Network Optimization: Theory and Algorithms. Operations Research 57(3): 586-594 (2009) | |

2008 | ||

40 | Dionne M. Aleman, Arvind Kumar, Ravindra K. Ahuja, H. Edwin Romeijn, James F. Dempsey: Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning. J. Global Optimization 42(4): 587-607 (2008) | |

39 | 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) | |

38 | Ravindra K. Ahuja,
Dorit S. Hochbaum:
Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time.
Operations Research 56(1): 255-261 (2008) | |

37 | Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin: The Locomotive Routing Problem. Transportation Science 42(4): 492-507 (2008) | |

2007 | ||

36 | 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 | |

35 | Artyom G. Nahapetyan, Ravindra K. Ahuja, F. Zeynep Sargut, Andy John, Kamalesh Somani: A Simulation/Optimization Framework for Locomotive Planning. ATMOS 2007 | |

34 | 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 | |

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

32 | 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) | |

31 | Ravindra K. Ahuja, Wei Huang, H. Edwin Romeijn, Dolores Romero Morales: A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints. INFORMS Journal on Computing 19(1): 14-26 (2007) | |

30 | Ravindra K. Ahuja, Jon Goodstein, Amit Mukherjee, James B. Orlin, Dushyant Sharma: A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model. INFORMS Journal on Computing 19(3): 416-428 (2007) | |

29 | Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin, Dushyant Sharma: Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem. INFORMS Journal on Computing 19(4): 646-657 (2007) | |

28 | Ravindra K. Ahuja, Krishna C. Jha, Jian Liu: Solving Real-Life Railroad Blocking Problems. Interfaces 37(5): 404-419 (2007) | |

27 | Ravindra K. Ahuja, Arvind Kumar, Krishna C. Jha, James B. Orlin: Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem. Operations Research 55(6): 1136-1146 (2007) | |

2006 | ||

26 | H. Edwin Romeijn, Ravindra K. Ahuja, James F. Dempsey, Arvind Kumar: A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems. Operations Research 54(2): 201-216 (2006) | |

2005 | ||

25 | 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) | |

24 | 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) | |

23 | Ravindra K. Ahuja, Jian Liu, James B. Orlin, Dushyant Sharma, Larry A. Shughart: Solving Real-Life Locomotive-Scheduling Problems. Transportation Science 39(4): 503-517 (2005) | |

2004 | ||

22 | 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) | |

21 | 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 | ||

20 | 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) | |

19 | 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 | ||

18 | 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) | |

17 | Ravindra K. Ahuja, James B. Orlin: Combinatorial algorithms for inverse network flow problems. Networks 40(4): 181-187 (2002) | |

16 | 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) | |

15 | Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà: Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights. Transportation Science 36(3): 326-336 (2002) | |

2000 | ||

14 | Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari: A greedy genetic algorithm for the quadratic assignment problem. Computers & OR 27(10): 917-934 (2000) | |

13 | Ravindra K. Ahuja, James B. Orlin: A Faster Algorithm for the Inverse Spanning Tree Problem. J. Algorithms 34(1): 177-193 (2000) | |

12 | 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 | ||

11 | Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin: Solving the Convex Cost Integer Dual Network Flow Problem. IPCO 1999: 31-44 | |

1998 | ||

10 | Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin: Diagnosing infeasibilities in network flow problems. Math. Program. 81: 263-280 (1998) | |

1997 | ||

9 | Ravindra K. Ahuja, James B. Orlin: Developing Fitter Genetic Algorithms. INFORMS Journal on Computing 9(3): 251-253 (1997) | |

8 | P. T. Sokkalingam, Prabha Sharma, Ravindra K. Ahuja: A new pivot selection rule for the network simplex algorithm. Math. Program. 77: 149-158 (1997) | |

1996 | ||

7 | Ravindra K. Ahuja, James B. Orlin: Use of Representative Operation Counts in Computational Testing of Algorithms. INFORMS Journal on Computing 8(3): 318-330 (1996) | |

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 | 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 | Ravindra K. Ahuja: Minimum cost-reliability ratio path problem. Computers & OR 15(1): 83-89 (1988) |