Jean-Philippe Vial

Publication Activity (10 Years)

Years Active: 1977-2024
Publications (10 Years): 4

Top Topics

Clinical Studies

Robust Optimization

Mathematical Programming

Distribution Systems

Top Venues

INFORMS J. Appl. Anal.

Publications

Erell Gachon, Jérémie Bigot, Elsa Cazelles, Aguirre Mimoun, Jean-Philippe Vial
Low dimensional representation of multi-patient flow cytometry datasets using optimal transport for minimal residual disease detection in leukemia. CoRR (2024)
Frédéric Babonneau, Gilles Corcos, Laurent Drouet, Jean-Philippe Vial
NeatWork: A Tool for the Design of Gravity-Driven Water Distribution Systems for Poor Rural Communities. INFORMS J. Appl. Anal. 49 (2) (2019)
Aharon Ben-Tal, Ruud Brekelmans, Dick den Hertog, Jean-Philippe Vial
Globalized Robust Optimization for Nonlinear Uncertain Inequalities. INFORMS J. Comput. 29 (2) (2017)
Aharon Ben-Tal, Dick den Hertog, Jean-Philippe Vial
Deriving robust counterparts of nonlinear uncertain inequalities. Math. Program. 149 (1-2) (2015)
Jean-Philippe Vial
Robust Optimization. ICORES (2014)
Frédéric Babonneau, Jean-Philippe Vial, Olivier Klopfenstein, Adam Ouorou
Robust capacity assignment solutions for telecommunications networks with uncertain demands. Networks 62 (4) (2013)
Shuangqing Liao, Christian van Delft, Jean-Philippe Vial
Distributionally robust workforce scheduling in call centres with uncertain arrival rates. Optim. Methods Softw. 28 (3) (2013)
Cesar Beltran-Royo, Jean-Philippe Vial, Antonio Alonso-Ayuso
Semi-Lagrangian relaxation applied to the uncapacitated facility location problem. Comput. Optim. Appl. 51 (1) (2012)
Frédéric Babonneau, Yurii E. Nesterov, Jean-Philippe Vial
Design and Operations of Gas Transmission Networks. Oper. Res. 60 (1) (2012)
Frédéric Babonneau, Jean-Philippe Vial
A partitioning algorithm for the network loading problem. Eur. J. Oper. Res. 204 (1) (2010)
Frédéric Babonneau, Jean-Philippe Vial
Test Instances for the Multicommodity Flow Problem: An Erratum. Oper. Res. 57 (4) (2009)
Frédéric Babonneau, Jean-Philippe Vial
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Math. Program. 120 (1) (2009)
Frédéric Babonneau, Jean-Philippe Vial
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum. Math. Program. 120 (1) (2009)
Laurent Drouet, Alain Haurie, Francesco Moresino, Jean-Philippe Vial, Marc Vielle, Laurent Viguier
An oracle based method to compute a coupled equilibrium in a model of international climate policy. Comput. Manag. Sci. 5 (1-2) (2008)
Yurii E. Nesterov, Jean-Philippe Vial
Confidence level solutions for stochastic programming. Autom. 44 (6) (2008)
Julien Thénié, Jean-Philippe Vial
Step decision rules for multistage stochastic programming: A heuristic approach. Autom. 44 (6) (2008)
Frédéric Babonneau, Jean-Philippe Vial
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands. Transp. Sci. 42 (2) (2008)
Adam Ouorou, Jean-Philippe Vial
A model for robust capacity planning for telecommunications networks under demand uncertainty. DRCN (2007)
Julien Thénié, Christian van Delft, Jean-Philippe Vial
Automatic Formulation of Stochastic Programs Via an Algebraic Modeling Language. Comput. Manag. Sci. 4 (1) (2007)
Cesar Beltran, Claude Tadonki, Jean-Philippe Vial
-Median Problem with a Semi-Lagrangian Relaxation. Comput. Optim. Appl. 35 (2) (2006)
Frédéric Babonneau, Olivier du Merle, Jean-Philippe Vial
Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM. Oper. Res. 54 (1) (2006)
Aharon Ben-Tal, Boaz Golany, Arkadi Nemirovski, Jean-Philippe Vial
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach. Manuf. Serv. Oper. Manag. 7 (3) (2005)
Claude Tadonki, Jean-Philippe Vial
Efficient Algorithm for Linear Pattern Separation. International Conference on Computational Science (2004)
Christian van Delft, Jean-Philippe Vial
A practical implementation of stochastic programming: an application to the evaluation of option contracts in supply chains. Autom. 40 (5) (2004)
Dean A. Carlson, Alain Haurie, Jean-Philippe Vial, Daniel S. Zachary
Large-scale convex optimization methods for air quality policy assessment. Autom. 40 (3) (2004)
Yurii E. Nesterov, Jean-Philippe Vial
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. Math. Program. 99 (1) (2004)
Olivier Péton, Jean-Philippe Vial
Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method. Comput. Optim. Appl. 24 (1) (2003)
Jean-Louis Goffin, Jean-Philippe Vial
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17 (5) (2002)
Jacek Gondzio, Robert Sarkissian, Jean-Philippe Vial
Parallel Implementation of a Central Decomposition Method for Solving Large-Scale Planning Problems. Comput. Optim. Appl. 19 (1) (2001)
Jean-Louis Goffin, Jean-Philippe Vial
Multiple Cuts in the Analytic Center Cutting Plane Method. SIAM J. Optim. 11 (1) (2000)
Emmanuel Fragnière, Jacek Gondzio, Jean-Philippe Vial
Building and Solving Large-Scale Stochastic Programs on an Affordable Distributed Computing System. Ann. Oper. Res. 99 (1-4) (2000)
Jerzy A. Filar, Jacek Gondzio, Alain Haurie, Francesco Moresino, Jean-Philippe Vial
Decomposition and parallel processing techniques for two-time scale controlled Markov chains. CDC (2000)
Yurii E. Nesterov, Jean-Philippe Vial
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities. SIAM J. Optim. 9 (3) (1999)
Jean-Louis Goffin, Jean-Philippe Vial
A two-cut approach in the analytic center cutting plane method. Math. Methods Oper. Res. 49 (1) (1999)
Jean-Louis Goffin, Jean-Philippe Vial
Shallow, deep and very deep cuts in the analytic center cutting plane method. Math. Program. 84 (1) (1999)
Tamás Terlaky, Jean-Philippe Vial
Computing Maximum Likelihood Estimators of Convex Density Functions. SIAM J. Sci. Comput. 19 (2) (1998)
Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial
On Improvements to the Analytic Center Cutting Plane Method. Comput. Optim. Appl. 11 (1) (1998)
Jean-Philippe Vial
A path-following version of the Todd-Burrell procedure for linear programming. Math. Methods Oper. Res. 46 (2) (1997)
Jean-Louis Goffin, Jacek Gondzio, Robert Sarkissian, Jean-Philippe Vial
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Program. 76 (1996)
Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial
Primal-dual target-following algorithms for linear programming. Ann. Oper. Res. 62 (1) (1996)
Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial
Long-step primal-dual target-following algorithms for linear programming. Math. Methods Oper. Res. 44 (1) (1996)
Olivier Bahn, Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial
A cutting plane method from analytic centers for stochastic programming. Math. Program. 69 (1995)
Jean-Louis Goffin, Jean-Philippe Vial
Short Steps with Karmarkar's Projective Algorithm for Linear Programming. SIAM J. Optim. 4 (1) (1994)
Olivier Bahn, Jean-Louis Goffin, Jean-Philippe Vial, Olivier du Merle
Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming. Discret. Appl. Math. 49 (1-3) (1994)
Jean-Louis Goffin, Jean-Philippe Vial
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. Math. Program. 60 (1993)
Chris Fraley, Jean-Philippe Vial
Alternative Approaches to Feasibility in Projective Methods for Linear Programming. INFORMS J. Comput. 4 (3) (1992)
Dick den Hertog, Cornelis Roos, Jean-Philippe Vial
A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming. SIAM J. Optim. 2 (1) (1992)
Kees Roos, Jean-Philippe Vial
A polynomial method of approximate centers for linear programming. Math. Program. 54 (1992)
Guy de Ghellinck, Jean-Philippe Vial
An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex. Math. Program. 39 (1) (1987)
Guy de Ghellinck, Jean-Philippe Vial
A Polynomial Newton Method for Linear Programming. Algorithmica 1 (4) (1986)
Jean-Philippe Vial
Strong and Weak Convexity of Sets and Functions. Math. Oper. Res. 8 (2) (1983)
Jean-Philippe Vial, Israel Zang
Unconstrained Optimization by Approximation of the Gradient Path. Math. Oper. Res. 2 (3) (1977)