# Katta G. Murty - Publications

## Affiliations: | University of Michigan, Ann Arbor, Ann Arbor, MI |

##### Area:

Operations Research, MathematicsYear | Citation | Score | |||
---|---|---|---|---|---|

2015 | Nag B, Murty KG. Diesel locomotive fueling problem (LFP) in railroad operations International Series in Operations Research and Management Science. 212: 17-33. DOI: 10.1007/S12597-012-0082-5 |
0.349 | |||

2012 | Khurana A, Murty KG. How effective is aggregation for solving 0-1 models? Opsearch. 49: 78-85. DOI: 10.1007/S12597-011-0062-1 |
0.42 | |||

2010 | Murty KG, Oskoorouchi MR. Sphere Methods for LP Algorithmic Operations Research. 5: 417-444. DOI: 10.1007/978-1-4419-1291-6_8 |
0.403 | |||

2009 | Murty KG. A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes Optimization Letters. 3: 211-237. DOI: 10.1007/S11590-008-0103-8 |
0.427 | |||

2009 | Murty KG, Oskoorouchi MR. Note on implementing the new sphere method for LP using matrix inversions sparingly Optimization Letters. 3: 137-160. DOI: 10.1007/S11590-008-0098-1 |
0.334 | |||

2005 | Murty KG. A Gravitational Interior Point Method for LP Opsearch. 42: 28-36. DOI: 10.1007/Bf03398711 |
0.372 | |||

2003 | Linn R, Liu JY, Wan YW, Zhang C, Murty KG. Rubber tired gantry crane deployment for container yard operation Computers and Industrial Engineering. 45: 429-442. DOI: 10.1016/S0360-8352(03)00046-9 |
0.303 | |||

2003 | Zhang C, Liu J, Wan YW, Murty KG, Linn RJ. Storage space allocation in container terminals Transportation Research Part B: Methodological. 37: 883-903. DOI: 10.1016/S0191-2615(02)00089-9 |
0.399 | |||

2002 | Wah PK, Murty KG, Joneja A, Chiu LC. Tool path optimization in layered manufacturing Iie Transactions (Institute of Industrial Engineers). 34: 335-347. DOI: 10.1080/07408170208928874 |
0.365 | |||

2002 | Yi T, Murty KG, Spera C. Matchings in colored bipartite networks Discrete Applied Mathematics. 121: 261-277. DOI: 10.1016/S0166-218X(01)00300-6 |
0.42 | |||

2000 | Alfakih AY, Yi T, Murty KG. Facets of an Assignment Problem with 0-1 Side Constraint Journal of Combinatorial Optimization. 4: 365-388. DOI: 10.1023/A:1009878328812 |
0.391 | |||

2000 | Billups SC, Murty KG. Complementarity problems Journal of Computational and Applied Mathematics. 124: 303-318. DOI: 10.1016/S0377-0427(00)00432-5 |
0.35 | |||

1999 | Murty KG, Djang PA. U.S. Army National Guard's mobile training simulators location and routing problem Operations Research. 47: 175-182. DOI: 10.1287/Opre.47.2.175 |
0.344 | |||

1999 | Hadj-Alouane AB, Bean JC, Murty KG. A hybrid genetic/optimization algorithm for a task allocation problem Journal of Scheduling. 2: 189-201. DOI: 10.1002/(Sici)1099-1425(199907/08)2:4<189::Aid-Jos25>3.0.Co;2-I |
0.355 | |||

1998 | Alfakih AY, Murty KG. Adjacency on the constrained assignment problem Discrete Applied Mathematics. 87: 269-274. DOI: 10.1016/S0166-218X(98)00063-8 |
0.329 | |||

1997 | Takriti S, Murty KG. On the convergence of the block principal pivotal algorithm for the LCP European Journal of Operational Research. 102: 657-666. DOI: 10.1016/S0377-2217(96)00243-3 |
0.424 | |||

1996 | Kabadi S, Murty KG, Spera C. Clustering problems in optimization models Computational Economics. 9: 229-239. DOI: 10.1007/Bf00121636 |
0.348 | |||

1995 | Murty KG, Chung SJ. Segments in enumerating faces Mathematical Programming. 70: 27-45. DOI: 10.1007/Bf01585927 |
0.396 | |||

1993 | Murty KG. On the complexity of a special basis problem in LP Discrete Applied Mathematics. 47: 181-185. DOI: 10.1016/0166-218X(93)90091-2 |
0.406 | |||

1993 | Chung SJ, Hamacher HW, Maffioli F, Murty KG. Note on combinatorial optimization with max-linear objective functions Discrete Applied Mathematics. 42: 139-145. DOI: 10.1016/0166-218X(93)90043-N |
0.408 | |||

1993 | Arantes JC, Birge JR, Murty KG. Studies of lexicography in the generalized network simplex method Annals of Operations Research. 46: 235-248. DOI: 10.1007/Bf02023097 |
0.404 | |||

1992 | Al-Sultan KS, Murty KG. Exterior point algorithms for nearest points and convex quadratic programs Mathematical Programming, Series B. 57: 145-161. DOI: 10.1007/Bf01581078 |
0.435 | |||

1992 | Yang K, Murty KG. New iterative methods for linear inequalities Journal of Optimization Theory and Applications. 72: 163-185. DOI: 10.1007/Bf00939954 |
0.382 | |||

1990 | Kelly LM, Murty KG, Watson LT. CP-rays in simplicial cones Mathematical Programming. 48: 387-414. DOI: 10.1007/Bf01582265 |
0.385 | |||

1989 | Fathi Y, Murty KG. Computational behavior of a feasible direction method for linear programming European Journal of Operational Research. 40: 322-328. DOI: 10.1016/0377-2217(89)90424-4 |
0.638 | |||

1989 | Chang SY, Murty KG. The steepest descent gravitational method for linear programming Discrete Applied Mathematics. 25: 211-239. DOI: 10.1016/0166-218X(89)90002-4 |
0.418 | |||

1988 | Murty KG. A correction to a result in linear programming Discrete Applied Mathematics. 20: 177-180. DOI: 10.1016/0166-218X(88)90063-7 |
0.337 | |||

1987 | Murty KG, Kabadi SN. Some NP-complete problems in quadratic and nonlinear programming Mathematical Programming. 39: 117-129. DOI: 10.1007/Bf02592948 |
0.403 | |||

1986 | Chung SJ, Murty KG, Chang SY. On KΔ Discrete Applied Mathematics. 15: 199-211. DOI: 10.1016/0166-218X(86)90042-9 |
0.384 | |||

1986 | Fredricksen JT, Watson LT, Murty KG. A finite characterization of K-matrices in dimensions less than four Mathematical Programming. 35: 17-31. DOI: 10.1007/Bf01589438 |
0.333 | |||

1984 | Murty KG, Fathi Y. A feasible direction method for linear programming Operations Research Letters. 3: 121-127. DOI: 10.1016/0167-6377(84)90003-8 |
0.374 | |||

1982 | Murty KG, Fathi Y. A critical index algorithm for nearest point problems on simplicial cones Mathematical Programming. 23: 206-215. DOI: 10.1007/Bf01583789 |
0.456 | |||

1982 | Murty KG, Perin C. A 1-matching blossom-type algorithm for edge covering problems Networks. 12: 379-391. DOI: 10.1002/Net.3230120403 |
0.4 | |||

1980 | Murty KG. Computational complexity of parametric linear programming Mathematical Programming. 19: 213-219. DOI: 10.1007/Bf01581642 |
0.404 | |||

1972 | Murty KG. On the number of solutions to the complementarity problem and spanning properties of complementary cones Linear Algebra and Its Applications. 5: 65-108. DOI: 10.1016/0024-3795(72)90019-5 |
0.354 | |||

1972 | Murty KG. A fundamental problem in linear inequalities with applications to the travelling salesman problem Mathematical Programming. 2: 296-308. DOI: 10.1007/Bf01584550 |
0.492 | |||

1971 | Murty KG. Adjacency on Convex Polyhedra Siam Review. 13: 377-386. DOI: 10.1137/1013066 |
0.382 | |||

1971 | Murty KG. On a Characterization of P-Matrices Siam Journal On Applied Mathematics. 20: 378-384. DOI: 10.1137/0120041 |
0.316 | |||

1969 | Murty KG. On the Tours of a Traveling Salesman Siam Journal On Control. 7: 122-131. DOI: 10.1137/0307009 |
0.355 | |||

1968 | Murty KG. Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost Operations Research. 16: 682-687. DOI: 10.1287/Opre.16.3.682 |
0.383 | |||

1968 | Murty KG. Solving the Fixed Charge Problem by Ranking the Extreme Points Operations Research. 16: 268-279. DOI: 10.1287/Opre.16.2.268 |
0.435 | |||

Show low-probability matches. |