The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Philippe Vial: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Claude Tadonki, Jean-Philippe Vial
    Efficient Algorithm for Linear Pattern Separation. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science, 2004, pp:679-682 [Conf]
  2. Guy de Ghellinck, Jean-Philippe Vial
    A Polynomial Newton Method for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:4, pp:425-453 [Journal]
  3. O. Bahn, Jean-Louis Goffin, Jean-Philippe Vial, O. Du Merle
    Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:3-23 [Journal]
  4. O. Bahn, O. Du Merle, Jean-Louis Goffin, Jean-Philippe Vial
    A cutting plane method from analytic centers for stochastic programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:69, n:, pp:45-73 [Journal]
  5. Jean-Louis Goffin, Jacek Gondzio, Robert Sarkissian, Jean-Philippe Vial
    Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1996, v:76, n:, pp:131-154 [Journal]
  6. Jean-Louis Goffin, Jean-Philippe Vial
    On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:81-92 [Journal]
  7. Yu. Nesterov, Jean-Philippe Vial
    Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:99, n:1, pp:149-174 [Journal]
  8. Kees Roos, Jean-Philippe Vial
    A polynomial method of approximate centers for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:295-305 [Journal]

Search in 0.019secs, Finished in 0.020secs
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