Searching for authors named "Narendra Karmarkar" – sorted by Relevance.
-
Iteration Algorithm for Computing Bounds in Quadratic Optimization Problems
- 1 Department of Computer Science, Stanford University, Stanford, CA 94305 USA Narendra K. Karmarkar
- Cited by 7 (0 self) – Add To MetaCart
-
An Interior Point Approach to the Maximum Independent Set Problem in Dense Random Graphs
- Narendra Karmarkar, Mauricio G.C. Resende and K.G. Ramakrishnan Mathematical Sciences Research Center AT
- Cited by 6 (3 self) – Add To MetaCart
-
Computational and Complexity Results for an Interior Point Algorithm on Multicommodity Flow Problems (Extended Abstract)
- Problems Anil P. Kamath 1 2 Narendra K. Karmarkar 3 , K.G. Ramakrishnan 3 , Extended Abstract 1
- Cited by 6 (1 self) – Add To MetaCart
-
An Interior Point Algorithm to Solve Computationally Difficult Set Covering Problems
- An interior point algorithm to solve computationally difficult set covering problems Narendra
- Cited by 24 (4 self) – Add To MetaCart
-
computationally difficult set covering problems
- An interior point algorithm to solve computationally difficult set covering problems ∗ Narendra
- Add To MetaCart
-
An Implementation Of Karmarkar's Algorithm For Linear Programming
- AN IMPLEMENTATION OF KARMARKAR'S ALGORITHM FOR LINEAR PROGRAMMING ILAN ADLER, NARENDRA KARMARKAR
- Cited by 50 (4 self) – Add To MetaCart
-
A Continuous Approach to Inductive Inference
- A Continuous Approach to Inductive Inference Anil P. Kamath Narendra K. Karmarkar K
- Cited by 35 (2 self) – Add To MetaCart

