
Search the dblp DataBase
JeanPhilippe Vial:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Claude Tadonki, JeanPhilippe Vial
Efficient Algorithm for Linear Pattern Separation. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science, 2004, pp:679682 [Conf]
 Guy de Ghellinck, JeanPhilippe Vial
A Polynomial Newton Method for Linear Programming. [Citation Graph (0, 0)][DBLP] Algorithmica, 1986, v:1, n:4, pp:425453 [Journal]
 O. Bahn, JeanLouis Goffin, JeanPhilippe 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:13, pp:323 [Journal]
 O. Bahn, O. Du Merle, JeanLouis Goffin, JeanPhilippe Vial
A cutting plane method from analytic centers for stochastic programming. [Citation Graph (0, 0)][DBLP] Math. Program., 1995, v:69, n:, pp:4573 [Journal]
 JeanLouis Goffin, Jacek Gondzio, Robert Sarkissian, JeanPhilippe 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:131154 [Journal]
 JeanLouis Goffin, JeanPhilippe 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:8192 [Journal]
 Yu. Nesterov, JeanPhilippe Vial
Augmented selfconcordant barriers and nonlinear optimization problems with finite complexity. [Citation Graph (0, 0)][DBLP] Math. Program., 2004, v:99, n:1, pp:149174 [Journal]
 Kees Roos, JeanPhilippe Vial
A polynomial method of approximate centers for linear programming. [Citation Graph (0, 0)][DBLP] Math. Program., 1992, v:54, n:, pp:295305 [Journal]
Search in 0.003secs, Finished in 0.004secs
