The SCEAS System
| |||||||

## Search the dblp DataBase
Michael J. Todd:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Michael J. Todd, Bruce P. Burrell
**An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1986, v:1, n:4, pp:409-424 [Journal] - Michael J. Todd, Yufei Wang
**On Combined Phase 1-Phase 2 Projective Methods for Linear Programming.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1993, v:9, n:1, pp:64-83 [Journal] - Ronald A. DeVore, Arieh Iserles, Michael J. Todd
**Editorial.**[Citation Graph (0, 0)][DBLP] Foundations of Computational Mathematics, 2003, v:3, n:2, pp:111- [Journal] - Yu. E. Nesterov, Michael J. Todd
**On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods.**[Citation Graph (0, 0)][DBLP] Foundations of Computational Mathematics, 2002, v:2, n:4, pp:333-361 [Journal] - Robert M. Freund, Michael J. Todd
**A Constructive Proof of Tucker's Combinatorial Lemma.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1981, v:30, n:3, pp:321-325 [Journal] - Michael J. Todd
**Linear and quadratic programming in oriented matroids.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1985, v:39, n:2, pp:105-133 [Journal] - Leonid Khachiyan, Michael J. Todd
**On the complexity of approximating the maximal inscribed ellipsoid for a polytope.**[Citation Graph (0, 0)][DBLP] Math. Program., 1993, v:61, n:, pp:137-159 [Journal] - John E. Mitchell, Michael J. Todd
**Solving combinatorial optimization problems using Karmarkar's algorithm.**[Citation Graph (0, 0)][DBLP] Math. Program., 1992, v:56, n:, pp:245-284 [Journal] - Shinji Mizuno, Michael J. Todd
**An O(n**[Citation Graph (0, 0)][DBLP]^{3}L) adaptive path following algorithm for a linear complementarity problem. Math. Program., 1991, v:52, n:, pp:587-595 [Journal] - Reha H. Tütüncü, K. C. Toh, Michael J. Todd
**Solving semidefinite-quadratic-linear programs using SDPT3.**[Citation Graph (0, 0)][DBLP] Math. Program., 2003, v:95, n:2, pp:189-217 [Journal] - Michael J. Todd
**Potential-reduction methods in mathematical programming.**[Citation Graph (0, 0)][DBLP] Math. Program., 1996, v:76, n:, pp:3-45 [Journal] - Michael J. Todd, Yinyu Ye
**Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.**[Citation Graph (0, 0)][DBLP] Math. Program., 1998, v:81, n:, pp:1-21 [Journal] - Michael J. Todd
**On Anstreicher's combined phase I-phase II projective algorithm for linear programming.**[Citation Graph (0, 0)][DBLP] Math. Program., 1992, v:55, n:, pp:1-15 [Journal] - Michael J. Todd
**Combining phase I and phase II in a potential reduction algorithm for linear programming.**[Citation Graph (0, 0)][DBLP] Math. Program., 1993, v:59, n:, pp:133-150 [Journal] - Michael J. Todd
**Interior-point algorithms for semi-infinite programming.**[Citation Graph (0, 0)][DBLP] Math. Program., 1994, v:65, n:, pp:217-245 [Journal] - Yinyu Ye, Michael J. Todd
**Containing and Shrinking Ellipsoids in the Path-Following Algorithm.**[Citation Graph (0, 0)][DBLP] Math. Program., 1990, v:47, n:, pp:1-9 [Journal] - Michael J. Todd, Levent Tunçel
**A New Triangulation for Simplicial Algorithms.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1993, v:6, n:1, pp:167-180 [Journal] - Michael J. Todd, E. Alper Yildirim
**On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:13, pp:1731-1744 [Journal] - Michael J. Todd
**Dual versus primal-dual interior-point methods for linear and conic programming.**[Citation Graph (0, 0)][DBLP] Math. Program., 2008, v:111, n:1-2, pp:301-313 [Journal] **Active surface modeling at CT resolution limits with micro CT ground truth.**[Citation Graph (, )][DBLP]
Search in 0.025secs, Finished in 0.026secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |