|
Search the dblp DataBase
Jean-Philippe Vial:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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.003secs, Finished in 0.004secs
|