N. Karmarkar

发表

A new polynomial-time algorithm for linear programming

Narendra Karmarkar, N. Karmarkar, 1984, Comb..

Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm

Mauricio G. C. Resende, Ilan Adler, Narendra Karmarkar, 1989, INFORMS J. Comput..

A new polynomial-time algorithm for linear programming

Narendra Karmarkar, N. Karmarkar, 1984, STOC '84.

An implementation of Karmarkar's algorithm for linear programming

Mauricio G. C. Resende, Ilan Adler, Narendra Karmarkar, 1989, Math. Program..

A continuous approach to compute upper bounds in quadratic maximization problems with integer constraints

N. Karmarkar, A. Kamath, 1992 .

Power series variants of Karmarkar-type algorithms

Jeffrey C. Lagarias, Lev Slutsman, Narendra K. Karmarkar, 1989, AT&T Technical Journal.

An interior point approach to Boolean vector function synthesis

K. G. Ramakrishnan, M. Resende, N. Karmarkar, 1993, Proceedings of 36th Midwest Symposium on Circuits and Systems.

An O(nL) Iteration Algorithm for Computing Bounds in Quadratic Optimization Problems

N. Karmarkar, A. Kamath, 1993 .

Probabilistic analysis of optimum partitioning

G. S. Lueker, A. Odlyzko, R. Karp, 1986, Journal of Applied Probability.

An efficient approximation scheme for the one-dimensional bin-packing problem

Richard M. Karp, Narendra Karmarkar, R. Karp, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

An interior point algorithm to solve computationally difficult set covering problems

Mauricio G. C. Resende, K. G. Ramakrishnan, Narendra Karmarkar, 1991, Math. Program..

An Interior-Point Approach to NP-Complete Problems

Narendra Karmarkar, N. Karmarkar, 1990, Conference on Integer Programming and Combinatorial Optimization.

A Monte-Carlo Algorithm for Estimating the Permanent

Richard J. Lipton, László Lovász, Richard M. Karp, 1993, SIAM J. Comput..

Computational and Complexity Results for an Interior Point Algorithm on Multicommodity Flow Problems (Extended Abstract)

N. Karmarkar, 1994 .

Probabilistic analysis of some bin-packing problems

N. Karmarkar, 1982, FOCS 1982.

An Interior Point Approach to the Maximum Independent Set Problem in Dense Random Graphs

K. G. Ramakrishnan, M. Resende, N. Karmarkar, 1999 .

An Approach to Data Reduction and Clustering with Theoretical Guarantees

Partha Niyogi, Narendra Karmarkar, P. Niyogi, 2000, ICML.

Interior-point methods in optimization

Narendra Karmarkar, N. Karmarkar, 1992 .

An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems

Narendra Karmarkar, S. A. Thakur, N. Karmarkar, 1992, IPCO.

Computational results of an interior point algorithm for large scale linear programming

K. G. Ramakrishnan, Narendra Karmarkar, N. Karmarkar, 1991, Math. Program..

Beyond Convexity: New Perspectives in Computational Optimization

Narendra Karmarkar, N. Karmarkar, 2010, SEAL.

Probabilistic analysis of some bin-packing problems

N. Karmarkar, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

A novel approach to overcome bandwidth limitations of parallel computers based on cmos, Part-1 : General concepts

N. Karmarkar, Narendra K Karmarkar, 2009, 2009 2nd International Workshop on Electron Devices and Semiconductor Technology.

A continuous approach to inductive inference

Mauricio G. C. Resende, K. G. Ramakrishnan, Narendra Karmarkar, 1992, Math. Program..

An Approximate Dual Projective Algorithm for Solving Assignment Problems

K. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath, 1991, Network Flows And Matching.

On Approximate GCDs of Univariate Polynomials

Narendra Karmarkar, Y. N. Lakshman, Yagati N. Lakshman, 1998, J. Symb. Comput..

Approximate polynomial greatest common divisors and nearest singular polynomials

Narendra Karmarkar, Y. N. Lakshman, Yagati N. Lakshman, 1996, ISSAC '96.

A continuous method for computing bounds in integer quadratic optimization problems

Narendra Karmarkar, Anil P. Kamath, N. Karmarkar, 1992, J. Glob. Optim..

Solution of P-matrix Linear Complementarity Problems Using a Potential Reduction Algorithm. Siam an Implementation of Karmarkar's Algorithm for Linear Programming. Mathematical Programming, 44:297{335, 1989. 2] F. Alizadeh. Optimization over Positive Semi-deenite Cone: Interior-point Methods and Com

P M Pardalos, P. Pardalos, G. Veiga, 1996 .

Computational experience with an interior point algorithm on the satisfiability problem

Mauricio G. C. Resende, K. G. Ramakrishnan, Narendra Karmarkar, 1990, IPCO.