A numerically stable optimization method based on A homogeneous function. - Janusz S. Kowalik; K. G. Ramakrishnan (Math. Program., 1976)

Solving Two-Commodity Transportation Problems with Coupling Constraints. - K. G. Ramakrishnan (J. ACM, 1980)

Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. - Anil P. Kamath; Narendra Karmarkar; K. G. Ramakrishnan; Mauricio G. C. Resende (IPCO, 1990)

An Approximate Dual Projective Algorithm for Solving Assignment Problems. - K. G. Ramakrishnan; Narendra Karmarkar; Anil P. Kamath (Network Flows And Matching, 1991)

Computational results of an interior point algorithm for large scale linear programming. - Narendra Karmarkar; K. G. Ramakrishnan (Math. Program., 1991)

An interior point algorithm to solve computationally difficult set covering problems. - Narendra Karmarkar; Mauricio G. C. Resende; K. G. Ramakrishnan (Math. Program., 1991)

A Unified Set of Proposals for Control and Design of High Speed Data Networks. - Debasis Mitra 001; Isi Mitrani; K. G. Ramakrishnan; Judith B. Seery; Alan Weiss (Queueing Syst. Theory Appl., 1991)

A continuous approach to inductive inference. - Anil P. Kamath; Narendra Karmarkar; K. G. Ramakrishnan; Mauricio G. C. Resende (Math. Program., 1992)

On the expected optimal value of random assignment problems: Experimental results and open questions. - Panos M. Pardalos; K. G. Ramakrishnan (Comput. Optim. Appl., 1993)

Lower bounds for the quadratic assignment problem. - Yong Li; Panos M. Pardalos; K. G. Ramakrishnan; Mauricio G. C. Resende (Ann. Oper. Res., 1994)

On-Line Routing for Permanent Virtural Circuits. - Rainer Gawlick; Charles R. Kalmanek; K. G. Ramakrishnan (INFOCOM, 1995)

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming. - Mauricio G. C. Resende; K. G. Ramakrishnan; Zvi Drezner (Oper. Res., 1995)

The allocation of value for jointly provided services. - Peter Linhart; Roy Radner; K. G. Ramakrishnan; Richard Steinberg (Telecommun. Syst., 1995)

On-line routing for permanent virtual circuits. - Rainer Gawlick; Charles R. Kalmanek; K. G. Ramakrishnan (Comput. Commun., 1996)

ATM network design and optimization: a multirate loss network framework. - Debasis Mitra 001; John A. Morrison; K. G. Ramakrishnan (IEEE/ACM Trans. Netw., 1996)

An overview of the multimedia communications exchange (MMCX) and its performance characterization. - Anwar Elwalid; Glen G. Freundlich; Paul M. Gerhardt; Hassan Hagirahim; K. G. Ramakrishnan; David Tse (Bell Labs Tech. J., 1997)

Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem. - Panos M. Pardalos; K. G. Ramakrishnan; Mauricio G. C. Resende; Yong Li (SIAM J. Optim., 1997)

VPN DESIGNER: A tool for design of multiservice virtual private networks. - Debasis Mitra 001; John A. Morrison; K. G. Ramakrishnan (Bell Labs Tech. J., 1998)

Dynamic bandwidth allocation algorithms for high-speed data wireless networks. - Matthew Andrews; Simon C. Borst; Francis Dominique; Predrag R. Jelenkovic; Krishnan Kumaran; K. G. Ramakrishnan; Philip A. Whiting (Bell Labs Tech. J., 1998)

Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources. - Debasis Mitra 001; John A. Morrison; K. G. Ramakrishnan (SIAM J. Appl. Math., 1998)

Virtual Private Networks: Joint Resource Allocation and Routing Design. - Debasis Mitra 001; John A. Morrison; K. G. Ramakrishnan (INFOCOM, 1999)

Optimization and Design of Network Routing Using Refined Asymptotic Approximations. - Debasis Mitra 001; John A. Morrison; K. G. Ramakrishnan (Perform. Evaluation, 1999)

Optimal Design of Signaling Networks for Internet Telephony. - Aravind Srinivasan; K. G. Ramakrishnan; Krishnan Kumaran; Murali Aravamudan; Shamim A. Naqvi (INFOCOM, 2000)

Efficient algorithms for location and sizing problems in network design. - Krishnan Kumaran; Aravind Srinivasan; Qiong Wang; Steven Lanning; K. G. Ramakrishnan (GLOBECOM, 2001)

Efficient Computation of Delay-sensitive Routes from One Source to All Destinations. - Ashish Goel; K. G. Ramakrishnan; Deepak Kataria; Dimitris Logothetis (INFOCOM, 2001)

A*prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints. - Gang Liu; K. G. Ramakrishnan (INFOCOM, 2001)

Optimal routing in shortest-path data networks. - K. G. Ramakrishnan; Manoel A. Rodrigues (Bell Labs Tech. J., 2001)

The structure and management of service level agreements in networks. - Eric Bouillet; Debasis Mitra 001; K. G. Ramakrishnan (IEEE J. Sel. Areas Commun., 2002)

Asymptotic Solution to an Inverse Problem for a Shared Unbuffered Resource. - John A. Morrison; K. G. Ramakrishnan (SIAM J. Appl. Math., 2002)