| Year |
Citation |
Score |
| 2015 |
Vaidyanathan B, Ahuja RK. Crew scheduling problem International Series in Operations Research and Management Science. 222: 163-175. DOI: 10.1007/978-1-4899-7571-3_6 |
0.467 |
|
| 2015 |
Vaidyanathan B, Ahuja RK. Locomotive scheduling problem International Series in Operations Research and Management Science. 222: 43-56. DOI: 10.1007/978-1-4899-7571-3_2 |
0.462 |
|
| 2014 |
Altner DS, Ahuja RK, Ergun Ö, Orlin JB. Very Large-Scale neighborhood search Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, Second Edition. 339-368. DOI: 10.1007/978-1-4614-6940-7_13 |
0.409 |
|
| 2011 |
Şahin G, Ahuja RK. Single-machine scheduling with stepwise tardiness costs and release times Journal of Industrial and Management Optimization. 7: 825-848. DOI: 10.3934/Jimo.2011.7.825 |
0.595 |
|
| 2011 |
Boǧ S, Nemani AK, Ahuja RK. Iterative algorithms for the curfew planning problem Journal of the Operational Research Society. 62: 593-607. DOI: 10.1057/Jors.2010.1 |
0.763 |
|
| 2011 |
Ahuja RK, Liebchen C. Special issue of Networks on optimization in scheduled transportation networks Networks. 57: 1-2. DOI: 10.1002/Net.20378 |
0.409 |
|
| 2010 |
Nemani AK, Bog S, Ahuja RK. Solving the curfew planning problem Transportation Science. 44: 506-523. DOI: 10.1287/Trsc.1100.0323 |
0.765 |
|
| 2010 |
Vaidyanathan B, Ahuja RK. Fast algorithms for specially structured minimum cost flow problems with applications Operations Research. 58: 1681-1696. DOI: 10.1287/Opre.1100.0846 |
0.811 |
|
| 2009 |
Şeref O, Ahuja RK, Orlin JB. Incremental Network Optimization: Theory and Algorithms Operations Research. 57: 586-594. DOI: 10.1287/Opre.1080.0607 |
0.65 |
|
| 2008 |
Vaidyanathan B, Ahuja RK, Orlin JB. The locomotive routing problem Transportation Science. 42: 492-507. DOI: 10.1287/Trsc.1080.0244 |
0.818 |
|
| 2008 |
Ahuja RK, Hochbaum DS. Solving linear cost dynamic lot-sizing problems in O(n log n) time Operations Research. 56: 255-261. DOI: 10.1287/Opre.1070.0508 |
0.533 |
|
| 2008 |
Liu J, Ahuja RK, Şahin G. Optimal network configuration and capacity expansion of railroads Journal of the Operational Research Society. 59: 911-920. DOI: 10.1057/Palgrave.Jors.2602403 |
0.518 |
|
| 2008 |
Vaidyanathan B, Ahuja RK, Liu J, Shughart LA. Real-life locomotive planning: New formulations and computational results Transportation Research Part B: Methodological. 42: 147-168. DOI: 10.1016/J.Trb.2007.06.003 |
0.803 |
|
| 2008 |
Aleman DM, Kumar A, Ahuja RK, Romeijn HE, Dempsey JF. Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning Journal of Global Optimization. 42: 587-607. DOI: 10.1007/S10898-008-9286-X |
0.487 |
|
| 2008 |
Şahin G, Ahuja RK. Lower bounding techniques for the degree-constrained network design problem Networks. 53: 334-344. DOI: 10.1002/net.20287 |
0.375 |
|
| 2008 |
Jha KC, Ahuja RK, Şahin G. New approaches for solving the block-to-train assignment problem Networks. 51: 48-62. DOI: 10.1002/net.20195 |
0.549 |
|
| 2007 |
Ahuja RK, Kumar A, Jha KC, Orlin JB. Exact and heuristic algorithms for the weapon-target assignment problem Operations Research. 55: 1136-1146. DOI: 10.1287/Opre.1070.0440 |
0.824 |
|
| 2007 |
Ahuja RK, Jha KC, Liu J. Solving real-life railroad blocking problems Interfaces. 37: 404-419. DOI: 10.1287/Inte.1070.0295 |
0.833 |
|
| 2007 |
Ahuja RK, Jha KC, Orlin JB, Sharma D. Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem Informs Journal On Computing. 19: 646-657. DOI: 10.1287/Ijoc.1060.0201 |
0.798 |
|
| 2007 |
Ahuja RK, Goodstein J, Mukherjee A, Orlin JB, Sharma D. A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model Informs Journal On Computing. 19: 416-428. DOI: 10.1287/Ijoc.1060.0193 |
0.542 |
|
| 2007 |
Ahuja RK, Huang W, Romeijn HE, Morales DR. A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints Informs Journal On Computing. 19: 14-26. DOI: 10.1287/ijoc.1050.0151 |
0.339 |
|
| 2007 |
Ahuja RK, Huang W, Romeijn HE, Morales DR. A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints Informs Journal On Computing. 19: 14-26. DOI: 10.1287/Ijoc.1050.0151 |
0.61 |
|
| 2007 |
Vaidyanathan B, Jha KC, Ahuja RK. Multicommodity network flow approach to the railroad crew-scheduling problem Ibm Journal of Research and Development. 51: 325-344. DOI: 10.1147/Rd.513.0325 |
0.772 |
|
| 2006 |
Romeijn HE, Ahuja RK, Dempsey JF, Kumar A. A new linear programming approach to radiation therapy treatment planning problems Operations Research. 54: 201-216. DOI: 10.1287/Opre.1050.0261 |
0.397 |
|
| 2005 |
Ahuja RK, Liu J, Orlin JB, Sharma D, Shughart LA. Solving Real-Life Locomotive-Scheduling Problems Transportation Science. 39: 503-517. DOI: 10.1287/Trsc.1050.0115 |
0.51 |
|
| 2005 |
Romeijn HE, Ahuja RK, Dempsey JF, Kumar A. A column generation approach to radiation therapy treatment planning using aperture modulation Siam Journal On Optimization. 15: 838-862. DOI: 10.1137/040606612 |
0.433 |
|
| 2005 |
Ahuja RK, Cunha CB. Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem Journal of Heuristics. 11: 465-481. DOI: 10.1007/S10732-005-2634-9 |
0.474 |
|
| 2005 |
Ahuja RK, Hamacher HW. A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy Networks. 45: 36-41. DOI: 10.1002/net.20047 |
0.371 |
|
| 2004 |
Ahuja RK, Orlin JB, Pallottino S, Scaparra MP, Scutellà MG. A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem Management Science. 50: 749-760. DOI: 10.1287/Mnsc.1030.0193 |
0.516 |
|
| 2004 |
Ahuja RK, Hochbaum DS, Orlin JB. A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem Algorithmica (New York). 39: 189-208. DOI: 10.1007/S00453-004-1085-2 |
0.618 |
|
| 2004 |
Ahuja RK, Liu J, Orlin JB, Goodstein J, Mukherjee A. A neighborhood search algorithm for the combined through and fleet assignment model with time windows Networks. 44: 160-171. DOI: 10.1002/Net.20026 |
0.5 |
|
| 2003 |
Romeijn HE, Ahuja RK, Dempsey JF, Kumar A, Li JG. A novel linear programming approach to fluence map optimization for intensity modulated radiation therapy treatment planning. Physics in Medicine and Biology. 48: 3521-42. PMID 14653560 DOI: 10.1088/0031-9155/48/21/005 |
0.445 |
|
| 2003 |
Ahuja RK, Orlin JB, Sharma D. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem Operations Research Letters. 31: 185-194. DOI: 10.1016/S0167-6377(02)00236-5 |
0.497 |
|
| 2002 |
Ahuja RK, Orlin JB, Pallottino S, Scutellà MG. Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights Transportation Science. 36: 326-336. DOI: 10.1287/Trsc.36.3.326.7827 |
0.544 |
|
| 2002 |
Ahuja RK, Orlin JB, Sharma P, Sokkalingam PT. A network simplex algorithm with O(n) consecutive degenerate pivots Operations Research Letters. 30: 141-148. DOI: 10.1016/S0167-6377(02)00114-1 |
0.491 |
|
| 2002 |
Ahuja RK, Ergun O, Orlin JB, Punnen AP. A survey of very large-scale neighborhood search techniques Discrete Applied Mathematics. 123: 75-102. DOI: 10.1016/S0166-218X(01)00338-9 |
0.538 |
|
| 2002 |
Ahuja RK, Orlin JB. Combinatorial algorithms for inverse network flow problems Networks. 40: 181-187. DOI: 10.1002/Net.10048 |
0.541 |
|
| 2001 |
Ahuja RK, Orlin JB. A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints Operations Research. 49: 784-789. DOI: 10.1287/Opre.49.5.784.10601 |
0.52 |
|
| 2001 |
Ahuja RK, Orlin JB, Sharma D. Multi-Exchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem Mathematical Programming. 91: 71-97. DOI: 10.1007/S101070100234 |
0.547 |
|
| 2001 |
Ahuja RK, Orlin JB, Pallottino S, Scutellà MG. Dynamic Shortest Paths Minimizing Travel Times and Costs Networks. 41: 197-205. DOI: 10.1002/Net.10072 |
0.595 |
|
| 2000 |
Ahuja RK, Orlin JB, Tiwari A. A greedy genetic algorithm for the quadratic assignment problem Computers & Operations Research. 27: 917-934. DOI: 10.1016/S0305-0548(99)00067-2 |
0.542 |
|
| 2000 |
Ahuja RK, Orlin JB. A Faster Algorithm for the Inverse Spanning Tree Problem Journal of Algorithms. 34: 177-193. DOI: 10.1006/Jagm.1999.1052 |
0.504 |
|
| 2000 |
Sokkalingam PT, Ahuja RK, Orlin JB. New polynomial-time cycle-canceling algorithms for minimum cost flows Networks. 36: 53-63. DOI: 10.1002/1097-0037(200008)36:1<53::Aid-Net6>3.0.Co;2-Y |
0.523 |
|
| 1999 |
Sokkalingam PT, Ahuja RK, Orlin JB. Solving Inverse Spanning Tree Problems Through Network Flow Techniques Operations Research. 47: 291-298. DOI: 10.1287/Opre.47.2.291 |
0.556 |
|
| 1999 |
Ahuja RK, Hochbaum DS, Orlin JB. Solving the convex cost integer dual network flow problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1610: 31-44. DOI: 10.1287/Mnsc.49.7.950.16384 |
0.607 |
|
| 1999 |
Ahuja RK, Orlin JB, Sechi GM, Zuddas P. Algorithms for the Simple Equal Flow Problem Management Science. 45: 1440-1455. DOI: 10.1287/Mnsc.45.10.1440 |
0.605 |
|
| 1998 |
Aggarwal CC, Ahuja RK, Hao J, Orlin JB. Diagnosing infeasibilities in network flow problems Mathematical Programming. 81: 263-280. DOI: 10.1007/Bf01580084 |
0.602 |
|
| 1997 |
Ahuja RK, Orlin JB. Commentary—Developing Fitter Genetic Algorithms Informs Journal On Computing. 9: 251-253. DOI: 10.1287/Ijoc.9.3.251 |
0.346 |
|
| 1997 |
Ahuja RK, Kodialam M, Mishra AK, Orlin JB. Computational investigations of maximum flow algorithms European Journal of Operational Research. 97: 509-542. DOI: 10.1016/S0377-2217(96)00269-X |
0.46 |
|
| 1997 |
Ahuja RK. The balanced linear programming problem European Journal of Operational Research. 101: 29-38. DOI: 10.1016/S0377-2217(96)00142-7 |
0.607 |
|
| 1997 |
Ahuja RK, Orlin JB. Equivalence of the primal and dual simplex algorithms for the maximum flow problem Operations Research Letters. 20: 101-108. DOI: 10.1016/S0167-6377(96)00052-1 |
0.548 |
|
| 1997 |
Sokkalingam PT, Sharma P, Ahuja RK. A new pivot selection rule for the network simplex algorithm Mathematical Programming. 78: 149-158. DOI: 10.1007/Bf02614367 |
0.521 |
|
| 1996 |
Ahuja RK, Orlin JB. Use of Representative Operation Counts in Computational Testing of Algorithms Informs Journal On Computing. 8: 318-330. DOI: 10.1287/Ijoc.8.3.318 |
0.455 |
|
| 1996 |
Ahuja RK, Batra JL, Gupta SK, Punnen AP. Optimal expansion of capacitated transshipment networks European Journal of Operational Research. 89: 176-184. DOI: 10.1016/S0377-2217(96)90072-7 |
0.628 |
|
| 1995 |
Polak GG, Ahuja RK. A polynomial-time algorithm for message routing in hierarchical communication networks European Journal of Operational Research. 80: 139-146. DOI: 10.1016/0377-2217(93)E0350-7 |
0.422 |
|
| 1995 |
Ahuja RK, Orlin JB. A capacity scaling algorithm for the constrained maximum flow problem Networks. 25: 89-98. DOI: 10.1002/Net.3230250207 |
0.544 |
|
| 1994 |
Ahuja RK, Orlin JB, Stein C. Improved Algorithms for Bipartite Network Flow Siam Journal On Computing. 23: 906-933. DOI: 10.1137/S0097539791199334 |
0.432 |
|
| 1992 |
Ahuja RK, Orlin JB. The Scaling Network Simplex Algorithm Operations Research. 40: 5-13. DOI: 10.1287/Opre.40.1.S5 |
0.506 |
|
| 1992 |
Orlin JB, Ahuja RK. New scaling algorithms for the assignment and minimum mean cycle problems Mathematical Programming. 54: 41-56. DOI: 10.1007/Bf01586040 |
0.571 |
|
| 1992 |
Ahuja RK, Goldberg AV, Orlin JB, Tarjan RE. Finding minimum-cost flows by double scaling Mathematical Programming. 53: 243-266. DOI: 10.1007/BF01585705 |
0.419 |
|
| 1991 |
Ahuja RK, Magnanti TL, Orlin JB. Some recent advances in network flows Siam Review. 33: 175-219. DOI: 10.1137/1033048 |
0.613 |
|
| 1991 |
Ahuja RK, Orlin JB. Distance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems Naval Research Logistics. 38: 413-430. DOI: 10.1002/1520-6750(199106)38:3<413::Aid-Nav3220380310>3.0.Co;2-J |
0.551 |
|
| 1989 |
Ahuja RK, Orlin JB. A Fast and Simple Algorithm for the Maximum Flow Problem Operations Research. 37: 748-759. DOI: 10.1287/opre.37.5.748 |
0.452 |
|
| 1989 |
Ahuja RK, Orlin JB, Tarjan RE. Improved Time Bounds for the Maximum Flow Problem Siam Journal On Computing. 18: 939-954. DOI: 10.1137/0218065 |
0.37 |
|
| 1988 |
Ahuja RK. Minimum cost-reliability ratio path problem Computers and Operations Research. 15: 83-89. DOI: 10.1016/0305-0548(88)90031-7 |
0.628 |
|
| 1987 |
Ahuja RK, Murty VVS. Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem Transportation Science. 21: 163-170. DOI: 10.1287/trsc.21.3.163 |
0.407 |
|
| 1987 |
Ahuja RK, Murty VVS. New lower planes for the network design problem Networks. 17: 113-127. DOI: 10.1002/Net.3230170202 |
0.497 |
|
| 1986 |
Ahuja RK. Algorithms for the minimax transportation problem Naval Research Logistics Quarterly. 33: 725-739. DOI: 10.1002/NAV.3800330415 |
0.414 |
|
| 1985 |
Ahuja RK. Minimax linear programming problem Operations Research Letters. 4: 131-134. DOI: 10.1016/0167-6377(85)90017-3 |
0.535 |
|
| 1984 |
Ahuja RK, Batra JL, Gupta SK. A parametric algorithm for convex cost network flow and related problems European Journal of Operational Research. 16: 222-235. DOI: 10.1016/0377-2217(84)90076-6 |
0.561 |
|
| 1983 |
Ahuja RK, Batra JL, Gupta SK. Combinatorial Optimization with Rational Objective Functions: A Communication Mathematics of Operations Research. 8: 314-314. DOI: 10.1287/Moor.8.2.314 |
0.531 |
|
| Show low-probability matches. |