K. G. Ramakrishnan - Publications

  1. A Numerically Stable Optimization Method Based on a Homogeneous Function, J. S. Kowalik and K. G. Ramakrishnan, Mathematical Programming, 11:1 (August 1976), pp. 50-66.
  2. Solving 2-Commodity Transportation Problems with Coupling Constraints, K. G. Ramakrishnan, J. Assoc. Comp. Mach., 27:4 (October 1980), pp. 736-757.
  3. A Class of Closed Markovian Queueing Networks: Integral Representations, Asymptotic Expansion, and Generalizations, J. McKenna, D. Mitra and K. G. Ramakrishnan, Bell Sys. Tech. J., 60:5 (May-June 1981).
  4. An Overview of PANACEA, a Software Package for Analyzing Markovian Queueing Networks, K. G. Ramakrishnan and D. Mitra, Bell Sys. Tech. J., 61:10 (December 1982).
  5. Parallel Time-Driven Simulation of a Network on a Shared Memory MIMD Computer, B. D. Lubachevsky and K. G. Ramakrishnan, Proceedings of the International Conference on Modelling Techniques and Tools for Performance Analysis, Paris, France, May 16-18, 1984.
  6. Overseas Network Planning, L. P. Sinha, B. A. Freedman, N. K. Karmarkar, A. Putcha and K. G. Ramakrishnan, Proceedings of the Third International Network Planning Symposium-NETWORKS '86, Tarpon Springs, Florida, June 1-6, 1986.
  7. PANACEA: An Integrated Set of Tools for Performance Analysis, K. G. Ramakrishnan and D. Mitra, Proceedings of the Fourth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Plenum Press, 1989, , Palma de Mallorca, Spain, September 15-17, 1988.
  8. Computational Experience with an Interior Point Algorithm on the Satisfiability Problem, A. P. Kamath, N. K. Karmarkar, K. G. Ramakrishnan and M. G. C. Resende, Annals of Operations Research, to appear in 1990.
  9. Computational experience with an interior point algorithm on the Satisfiability Problem, A. P. Kamath, N. K. Karmarkar, K. G. Ramakrishnan and M. G. C. Resende, Proc. of the MPS Conference on Integer Programming and Combinatorial Optimization, May 1990, pp. 333-349, TM BL011216-891106-28, BL011212-891106-30, BL011211-891106-15.
  10. An Interior Point Algorithm to Solve Computationally Difficult Set Covering Problems, N. K. Karmarkar, M. G. C. Resende and K. G. Ramakrishnan, Mathematical Programming, 52 (1991), pp. 597-618.
  11. An Interior Point Approach to the Maximum Independent Set Problem in Dense Random Graphs, N. K. Karmarkar, M. G. C. Resende and K. G. Ramakrishnan, Proc. of the XV Latin American Conference on Informatics, I (July 1989), pp. 241-260.
  12. Computational Results of an Interior Point Algorithm for Large Scale Linear Programming, N. K. Karmarkar and K. G. Ramakrishnan, Mathematical Programming, 52 (1991), pp. 555-586.
  13. Performance Analysis of a Parallel Architecture Based on 2-Dimensional Finite Geometries on Matrix-Vector Multiply Like Routines, I. S. Dhillon, N. K. Karmarkar and K. G. Ramakrishnan, Proc. of Super Computing `91 Conference, Albuquerque, NM Nov. 18-22, 1991, November, 1991.
  14. An Overview of the Compilation Process for a New Parallel Architecture., I. S. Dhillon, N. K. Karmarkar and K. G. Ramakrishnan, Proc. of the Supercomputing Symposium `91, Fredericton,NB, Canada, June 1991.
  15. A Continuous Approach to Inductive Inference, A. P. Kamath, N. K. Karmarkar, K. G. Ramakrishnan and M. G. C. Resende, Mathematical Programming, 57 (1992), pp. 215-238, TM BL011216-910329-04, BL011211-910329-03, BL011212-910329-06.
  16. Lower Bounds for the Quadratic Assignment Problem, Y. Li, P. M. Pardalos, K. G. Ramakrishnan and M. G. C. Resende, Annals of Operations Research, 50 (1994), pp. 387-411, TM BL011212-920501-09, BL011216-920501-03.
  17. An Approximate Dual Projective Algorithm for Solving Assignment Problems, K. G. Ramakrishnan, N.K. Karmarkar and A.P. Kamath, Proc. of the DIMACS Implementation Challenge Workshop, October 1991.
  18. An Interior Point Approach to Boolean Vector Function Synthesis, A. P. Kamath, N. K. Karmarkar, K. G. Ramakrishnan and M. G. C. Resende, Proc. of the 36th MSCAS, 1993, pp. 185-189, TM BL011211-930809-10, BL011212-930809-27, BL011216-930809-15.
  19. On the Expected Optimal Value of Random Assignment Problems: Experimental Results and Open Questions., P. M. Pardalos and K. G. Ramakrishnan, Computational Optimization and Applications, 2 (1993), pp. 261-271.
  20. Implementation of a Variance Reduction Based Lower Bound in a Branch and Bound Algorithm for the Quadratic Assignment Problem, Y. Li, P. M. Pardalos, K. G. Ramakrishnan and M. G. C. Resende, SIAM Journal on Optimization, (to appear), TM BL011216-940902-21.
  21. DIMACS Workshop on parallel processing of discrete optimization problems, P. M. Pardalos, M. G. C. Resende and K. G. Ramakrishnan, Center for Discrete Mathematics and Theoretical Computer Science, April 1994.
  22. Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming, M. G. C. Resende, K. G. Ramakrishnan and Z. Drezner, Operations Research, 43:5 (1995), TM BL011216-940701-07.
  23. Parallel processing of discrete optimization problems, P. M. Pardalos, M. G. C. Resende and K. G. Ramakrishnan, editors, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 22 (1995).
  24. A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming, K. G. Ramakrishnan, M. G. C. Resende and P. M. Pardalos, State of the Art in Global Optimization: Computational Methods and Applications, C. Floudas and P. M. Pardalos (editors), Kluwer Academic Publishers, 1995, TM BL011216-950217-05.
  25. The Allocation of Value for Jointly Provided Services, P. B. Linhart, R. Radner, K. G. Ramakrishnan and R. Steinberg, Telecommunications Systems, 1993, TM BL112120-940131-01TM BL11212-921102-22TM.
  26. Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming, M. G. C. Resende, K. G. Ramakrishnan and Z. Drezner, Operations Research, 43:5 (1995), TM BL011216-940701-07.