Narendra Karmarkar - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2010

Beyond Convexity: New Perspectives in Computational OptimizationNarendra Karmarkar. seal 2010: 1-23 [doi]

2000

An Approach to Data Reduction and Clustering with Theoretical GuaranteesPartha Niyogi, Narendra Karmarkar. icml 2000: 679-686

1998

On Approximate GCDs of Univariate PolynomialsNarendra Karmarkar, Yagati N. Lakshman. JSC, 26(6):653-666, 1998.

1996

Approximate Polynomial Greatest Common Divisors and Nearest Singular PolynomialsNarendra Karmarkar, Yagati N. Lakshman. issac 1996: 35-39 [doi]

1993

A Monte-Carlo Algorithm for Estimating the PermanentNarendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby. SICOMP, 22(2):284-293, 1993.

1992

A continuous method for computing bounds in integer quadratic optimization problemsAnil P. Kamath, Narendra Karmarkar. jgo, 2(3):229-241, 1992. [doi]

A continuous approach to inductive inferenceAnil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende. mp, 57:215-238, 1992.

An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization ProblemsNarendra Karmarkar, S. A. Thakur. ipco 1992: 406-420

1991

Computational results of an interior point algorithm for large scale linear programmingNarendra Karmarkar, K. G. Ramakrishnan. mp, 52:555-586, 1991.

A new parallel architecture for sparse matrix computation based on finite projective geometriesNarendra Karmarkar. sc 1991: 358-369 [doi]

An interior point algorithm to solve computationally difficult set covering problemsNarendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan. mp, 52:597-618, 1991.

An Approximate Dual Projective Algorithm for Solving Assignment ProblemsK. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath. dimacs 1993: 431-452

1990

Computational Experience with an Interior Point Algorithm on the Satisfiability ProblemAnil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende. ipco 1990: 333-349

An Interior-Point Approach to NP-Complete ProblemsNarendra Karmarkar. ipco 1990: 351-366

1989

An implementation of Karmarkar's algorithm for linear programmingIlan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar. mp, 44(1-3):297-335, 1989. [doi]

Data Structures and Programming Techniques for the Implementation of Karmarkar s AlgorithmIlan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga. informs, 1(2):84-106, 1989. [doi]

1984

A new polynomial-time algorithm for linear programmingNarendra Karmarkar. combinatorica, 4(4):373-396, 1984.

A New Polynomial-Time Algorithm for Linear ProgrammingNarendra Karmarkar. stoc 1984: 302-311

1982

An Efficient Approximation Scheme for the One-Dimensional Bin-Packing ProblemNarendra Karmarkar, Richard M. Karp. focs 1982: 312-320

Probabilistic Analysis of Some Bin-Packing ProblemsNarendra Karmarkar. focs 1982: 107-111

Sign in or sign up to see more results.

runs on WebDSL