default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRavindra K. Ahuja
Person information
- affiliation: University of Florida, Gainesville, USA
- award (1993): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[p1]Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen:
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 311-326- 2011
- [j54]Suat Bog, Ashish K. Nemani, Ravindra K. Ahuja:
Iterative algorithms for the curfew planning problem. J. Oper. Res. Soc. 62(4): 593-607 (2011) - [j53]Ravindra K. Ahuja, Christian Liebchen:
Special issue of Networks on optimization in scheduled transportation networks. Networks 57(1): 1-2 (2011) - 2010
- [j52]Balachandran Vaidyanathan, Ravindra K. Ahuja:
Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications. Oper. Res. 58(6): 1681-1696 (2010) - [j51]Ashish K. Nemani, Suat Bog, Ravindra K. Ahuja:
Solving the Curfew Planning Problem. Transp. Sci. 44(4): 506-523 (2010)
2000 – 2009
- 2009
- [j50]Onur Seref
, Ravindra K. Ahuja, James B. Orlin:
Incremental Network Optimization: Theory and Algorithms. Oper. Res. 57(3): 586-594 (2009) - [j49]Güvenç Sahin, Ravindra K. Ahuja:
Lower bounding techniques for the degree-constrained network design problem. Networks 53(4): 334-344 (2009) - [e2]Ravindra K. Ahuja, Rolf H. Möhring, Christos D. Zaroliagis:
Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems. Lecture Notes in Computer Science 5868, Springer 2009, ISBN 978-3-642-05464-8 [contents] - [r7]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Maximum Flow Problem. Encyclopedia of Optimization 2009: 2009-2020 - [r6]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Minimum Cost Flow Problem. Encyclopedia of Optimization 2009: 2095-2108 - [r5]Arvind Kumar, Balachandran Vaidyanathan, Krishna C. Jha, Ravindra K. Ahuja:
Railroad Crew Scheduling. Encyclopedia of Optimization 2009: 3227-3236 - [r4]Arvind Kumar, Balachandran Vaidyanathan, Ravindra K. Ahuja:
Railroad Locomotive Scheduling. Encyclopedia of Optimization 2009: 3236-3245 - 2008
- [j48]Ravindra K. Ahuja, Dorit S. Hochbaum:
Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time. Oper. Res. 56(1): 255-261 (2008) - [j47]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. Glob. Optim. 42(4): 587-607 (2008) - [j46]Jian Liu, Ravindra K. Ahuja, Güvenç Sahin:
Optimal network configuration and capacity expansion of railroads. J. Oper. Res. Soc. 59(7): 911-920 (2008) - [j45]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) - [j44]Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin:
The Locomotive Routing Problem. Transp. Sci. 42(4): 492-507 (2008) - 2007
- [j43]Balachandran Vaidyanathan, Krishna C. Jha, Ravindra K. Ahuja:
Multicommodity network flow approach to the railroad crew-scheduling problem. IBM J. Res. Dev. 51(3/4): 325-344 (2007) - [j42]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 J. Comput. 19(1): 14-26 (2007) - [j41]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 J. Comput. 19(3): 416-428 (2007) - [j40]Ravindra K. Ahuja, Krishna C. Jha, James B. Orlin, Dushyant Sharma:
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem. INFORMS J. Comput. 19(4): 646-657 (2007) - [j39]Ravindra K. Ahuja, Krishna C. Jha, Jian Liu:
Solving Real-Life Railroad Blocking Problems. Interfaces 37(5): 404-419 (2007) - [j38]Ravindra K. Ahuja, Arvind Kumar, Krishna C. Jha, James B. Orlin:
Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem. Oper. Res. 55(6): 1136-1146 (2007) - [c4]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 - [c3]Ravindra K. Ahuja, Christian Liebchen, Juan A. Mesa:
ATMOS 2007 Preface - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2007 - [c2]Artyom G. Nahapetyan, Ravindra K. Ahuja, F. Zeynep Sargut, Andy John, Kamalesh Somani:
A Simulation/Optimization Framework for Locomotive Planning. ATMOS 2007 - [e1]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. OASIcs 7, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [r3]Özlem Ergun, Abraham P. Punnen, James B. Orlin, Ravindra K. Ahuja:
Very Large-Scale Neighborhood Search. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j37]H. Edwin Romeijn, Ravindra K. Ahuja, James F. Dempsey, Arvind Kumar:
A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems. Oper. Res. 54(2): 201-216 (2006) - 2005
- [j36]Ravindra K. Ahuja, Claudio Barbieri da Cunha:
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem. J. Heuristics 11(5-6): 465-481 (2005) - [j35]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) - [j34]H. Edwin Romeijn, Ravindra K. Ahuja, James F. Dempsey, Arvind Kumar:
A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation. SIAM J. Optim. 15(3): 838-862 (2005) - [j33]Ravindra K. Ahuja, Jian Liu, James B. Orlin, Dushyant Sharma, Larry A. Shughart:
Solving Real-Life Locomotive-Scheduling Problems. Transp. Sci. 39(4): 503-517 (2005) - 2004
- [j32]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) - [j31]Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Paola Scaparra, Maria Grazia Scutellà:
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem. Manag. Sci. 50(6): 749-760 (2004) - [j30]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) - [r2]Richa Agarwal, Ravindra K. Ahuja, Gilbert Laporte, Zuo-Jun Max Shen:
A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem. Handbook of Scheduling 2004 - 2003
- [j29]Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem. Manag. Sci. 49(7): 950-964 (2003) - [j28]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) - [j27]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
- [j26]Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen:
A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123(1-3): 75-102 (2002) - [j25]Ravindra K. Ahuja, James B. Orlin:
Combinatorial algorithms for inverse network flow problems. Networks 40(4): 181-187 (2002) - [j24]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) - [j23]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. Transp. Sci. 36(3): 326-336 (2002) - 2001
- [j22]Ravindra K. Ahuja, James B. Orlin:
Inverse Optimization. Oper. Res. 49(5): 771-783 (2001) - [j21]Ravindra K. Ahuja, James B. Orlin:
A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints. Oper. Res. 49(5): 784-789 (2001) - [j20]Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma:
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program. 91(1): 71-97 (2001) - 2000
- [j19]Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari:
A greedy genetic algorithm for the quadratic assignment problem. Comput. Oper. Res. 27(10): 917-934 (2000) - [j18]Ravindra K. Ahuja, James B. Orlin:
A Faster Algorithm for the Inverse Spanning Tree Problem. J. Algorithms 34(1): 177-193 (2000) - [j17]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)
1990 – 1999
- 1999
- [j16]P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin:
Solving Inverse Spanning Tree Problems Through Network Flow Techniques. Oper. Res. 47(2): 291-298 (1999) - [c1]Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
Solving the Convex Cost Integer Dual Network Flow Problem. IPCO 1999: 31-44 - [r1]James B. Orlin, Ravindra K. Ahuja, David Simchi-Levi, Sunil Chopra, Bruce L. Golden, B. K. Kaku:
Networks And Flows. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j15]Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin:
Diagnosing infeasibilities in network flow problems. Math. Program. 81: 263-280 (1998) - 1997
- [j14]Ravindra K. Ahuja, James B. Orlin:
Developing Fitter Genetic Algorithms. INFORMS J. Comput. 9(3): 251-253 (1997) - [j13]P. T. Sokkalingam, Prabha Sharma, Ravindra K. Ahuja:
A new pivot selection rule for the network simplex algorithm. Math. Program. 77: 149-158 (1997) - [j12]Ravindra K. Ahuja, James B. Orlin:
Equivalence of the primal and dual simplex algorithms for the maximum flow problem. Oper. Res. Lett. 20(3): 101-108 (1997) - 1996
- [j11]Ravindra K. Ahuja, James B. Orlin:
Use of Representative Operation Counts in Computational Testing of Algorithms. INFORMS J. Comput. 8(3): 318-330 (1996) - 1995
- [j10]Ravindra K. Ahuja, James B. Orlin:
A capacity scaling algorithm for the constrained maximum flow problem. Networks 25(2): 89-98 (1995) - 1994
- [j9]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) - 1993
- [b1]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Network flows - theory, algorithms and applications. Prentice Hall 1993, ISBN 978-0-13-617549-0, pp. I-XV, 1-846 - 1992
- [j8]Ravindra K. Ahuja, James B. Orlin:
The Scaling Network Simplex Algorithm. Oper. Res. 40(Supplement-1): S5-S13 (1992) - [j7]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) - [j6]James B. Orlin, Ravindra K. Ahuja:
New scaling algorithms for the assignment and minimum mean cycle problems. Math. Program. 54: 41-56 (1992) - 1991
- [j5]Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Some Recent Advances in Network Flows. SIAM Rev. 33(2): 175-219 (1991) - 1990
- [j4]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)
1980 – 1989
- 1989
- [j3]Ravindra K. Ahuja, James B. Orlin:
A Fast and Simple Algorithm for the Maximum Flow Problem. Oper. Res. 37(5): 748-759 (1989) - [j2]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
- [j1]Ravindra K. Ahuja:
Minimum cost-reliability ratio path problem. Comput. Oper. Res. 15(1): 83-89 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
