The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Levent Tunçel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Levent Tunçel
    On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:4, pp:353-359 [Journal]
  2. Levent Tunçel
    Generalization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2001, v:1, n:3, pp:229-254 [Journal]
  3. Michel X. Goemans, Levent Tunçel
    When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2001, v:26, n:4, pp:796-815 [Journal]
  4. Levent Tunçel, Song Xu
    On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2001, v:26, n:2, pp:234-247 [Journal]
  5. Osman Güler, Levent Tunçel
    Characterization of the barrier parameter of homogeneous convex cones. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:81, n:, pp:55-76 [Journal]
  6. Arkadi Nemirovski, Levent Tunçel
    "Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:2, pp:261-294 [Journal]
  7. Van Anh Truong, Levent Tunçel
    Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:100, n:2, pp:295-316 [Journal]
  8. Levent Tunçel
    Constant potential primal-dual algorithms: A framework. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:66, n:, pp:145-159 [Journal]
  9. Erling S. Andersen, Etienne de Klerk, Levent Tunçel, Henry Wolkowicz, Shuzhong Zhang
    Foreword: Special issue on large-scale nonlinear and semidefinite programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:109, n:2-3, pp:207-209 [Journal]
  10. László Lipták, Levent Tunçel
    Lift-and-project ranks and antiblocker duality. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:1, pp:35-41 [Journal]
  11. Levent Tunçel
    On the Slater condition for the SDP relaxations of nonconvex sets. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:4, pp:181-186 [Journal]
  12. Levent Tunçel
    On the condition numbers for polyhedra in Karmarkar's form. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:4, pp:149-155 [Journal]
  13. 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]
  14. Masakazu Kojima, Levent Tunçel
    On the finite convergence of successive SDP relaxation methods. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:143, n:2, pp:325-341 [Journal]
  15. Chek Beng Chua, Levent Tunçel
    Invariance and efficiency of convex representations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2008, v:111, n:1-2, pp:113-140 [Journal]

  16. Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002