☰

Romesh Saigal - Publications

Affiliations: 
Industrial and Operations Engineering University of Michigan, Ann Arbor, Ann Arbor, MI 
Area:
Industrial Engineering, Civil Engineering, Operations Research
Tree Info Similar researchers PubMed Report error

20 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Luo Q, Saigal R, Chen Z, Yin Y. Accelerating the adoption of automated vehicles by subsidies: A dynamic games approach Transportation Research Part B-Methodological. 129: 226-243. DOI: 10.1016/J.Trb.2019.09.011  0.449
2014 Zhou H, Saigal R. Combinatorial Auction to Allocate Traffic Transportation Research Record. 2423: 35-43. DOI: 10.3141/2423-05  0.323
2012 Yang L, Saigal R, Zhou H. Distance-based dynamic pricing strategy for managed toll lanes Transportation Research Record. 90-99. DOI: 10.3141/2283-10  0.307
2000 Lin CJ, Saigal R. An incomplete cholesky factorization for dense symmetric positive definite matrices Bit Numerical Mathematics. 40: 536-558. DOI: 10.1023/A:1022323931043  0.302
1997 Saigal R. Matrix partitioning methods for interior point algorithms Sadhana-Academy Proceedings in Engineering Sciences. 22: 575-587. DOI: 10.1007/Bf02745580  0.36
1995 Saigal R. An infinitely summable series implementation of interior point methods Mathematics of Operations Research. 20: 597-616. DOI: 10.1287/Moor.20.3.597  0.344
1985 Saigal R, Stone RE. Proper, reflecting and absorbing facts of complementary cones Mathematical Programming. 31: 106-117. DOI: 10.1007/Bf02591864  0.309
1984 Jones PC, Saigal R, Schneider MH. A variable dimension homotopy for computing spatial equilibria Operations Research Letters. 3: 19-24. DOI: 10.1016/0167-6377(84)90066-X  0.318
1984 Saigal R. Computational complexity of a piecewise linear homotopy algorithm Mathematical Programming. 28: 164-173. DOI: 10.1007/Bf02612356  0.37
1983 Saigal R. HOMOTOPY FOR SOLVING LARGE, SPARSE AND STRUCTURED FIXED POINT PROBLEMS Mathematics of Operations Research. 8: 557-578. DOI: 10.1287/Moor.8.4.557  0.334
1981 Kojima M, Saigal R. On the number of solutions to a class of complementarity problems Mathematical Programming. 21: 190-203. DOI: 10.1007/Bf01584240  0.33
1979 Kojima M, Saigal R. On the number of solutions to a class of linear complementarity problems Mathematical Programming. 17: 136-139. DOI: 10.1007/Bf01588239  0.317
1977 Saigal R. On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting Mathematics of Operations Research. 2: 108-124. DOI: 10.1287/Moor.2.2.108  0.348
1977 Chen S, Saigal R. PRIMAL ALGORITHM FOR SOLVING A CAPACITATED NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR CONSTRAINTS Networks. 7: 59-79. DOI: 10.1002/Net.3230070105  0.359
1976 Saigal R. Extension of the Generalized Complementarity Problem Mathematics of Operations Research. 1: 260-266. DOI: 10.1287/Moor.1.3.260  0.305
1976 Netravali AN, Saigal R. Optimum Quantizer Design Using a Fixed‐Point Algorithm Bell System Technical Journal. 55: 1423-1435. DOI: 10.1002/J.1538-7305.1976.Tb02943.X  0.33
1973 Saigal R, Simon C. Generic properties of the complementarity problem Mathematical Programming. 4: 324-335. DOI: 10.1007/Bf01584674  0.314
1972 Saigal R. On the Alass of Complementary Cones and Lemke’s Algorithm Siam Journal On Applied Mathematics. 23: 46-60. DOI: 10.1137/0123006  0.332
1969 Saigal R. A Proof of the Hirsch Conjecture on the Polyhedron of the Shortest Route Problem Siam Journal On Applied Mathematics. 17: 1232-1238. DOI: 10.1137/0117114  0.317
1968 Saigal R. Letter to the Editor—A Constrained Shortest Route Problem Operations Research. 16: 205-209. DOI: 10.1287/Opre.16.1.205  0.304
Show low-probability matches.