Narendra K. Karmarkar

Available identifiers

Publication	Date of Publication	Type
An \(O(nL)\) iteration algorithm for computing bounds in quadratic optimization problems	2001-09-18	Paper
On approximate GCDs of univariate polynomials	2001-09-05	Paper
https://portal.mardi4nfdi.de/entity/Q4227320	1999-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q4283454	1994-03-10	Paper
A continuous approach to inductive inference	1994-01-06	Paper
A Monte-Carlo Algorithm for Estimating the Permanent	1993-05-17	Paper
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm	1993-01-16	Paper
A continuous method for computing bounds in integer quadratic optimization problems	1993-01-16	Paper
Computational results of an interior point algorithm for large scale linear programming	1992-06-27	Paper
An interior point algorithm to solve computationally difficult set covering problems	1992-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q5202838	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5202849	1990-01-01	Paper
Computational experience with an interior point algorithm on the satisfiability problem	1990-01-01	Paper
An implementation of Karmarkar's algorithm for linear programming	1989-01-01	Paper
Power Series Variants of Karmarkar-Type Algorithms	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4735034	1989-01-01	Paper
Probabilistic analysis of optimum partitioning	1986-01-01	Paper
A new polynomial-time algorithm for linear programming	1984-01-01	Paper
Towards a Broader View of Theory of Computing	N/A	Paper

This page was built for person: Narendra K. Karmarkar