Jean-Philippe Vial

According to our database1, Jean-Philippe Vial authored at least 52 papers between 1977 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
NeatWork: A Tool for the Design of Gravity-Driven Water Distribution Systems for Poor Rural Communities.
Interfaces, 2019

2017
Globalized Robust Optimization for Nonlinear Uncertain Inequalities.
INFORMS J. Comput., 2017

2015
Deriving robust counterparts of nonlinear uncertain inequalities.
Math. Program., 2015

2014
Robust Optimization.
Proceedings of the ICORES 2014, 2014

2013
Distributionally robust workforce scheduling in call centres with uncertain arrival rates.
Optim. Methods Softw., 2013

Robust capacity assignment solutions for telecommunications networks with uncertain demands.
Networks, 2013

2012
Design and Operations of Gas Transmission Networks.
Oper. Res., 2012

Semi-Lagrangian relaxation applied to the uncapacitated facility location problem.
Comput. Optim. Appl., 2012

2010
A partitioning algorithm for the network loading problem.
Eur. J. Oper. Res., 2010

2009
Nondifferentiable Optimization: Cutting Plane Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Nondifferentiable Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum.
Math. Program., 2009

ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems.
Math. Program., 2009

Test Instances for the Multicommodity Flow Problem: An Erratum.
Oper. Res., 2009

2008
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands.
Transp. Sci., 2008

An oracle based method to compute a coupled equilibrium in a model of international climate policy.
Comput. Manag. Sci., 2008

Step decision rules for multistage stochastic programming: A heuristic approach.
Autom., 2008

Confidence level solutions for stochastic programming.
Autom., 2008

2007
Automatic Formulation of Stochastic Programs Via an Algebraic Modeling Language.
Comput. Manag. Sci., 2007

2006
Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM.
Oper. Res., 2006

Solving the <i>p</i> -Median Problem with a Semi-Lagrangian Relaxation.
Comput. Optim. Appl., 2006

2005
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach.
Manuf. Serv. Oper. Manag., 2005

2004
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity.
Math. Program., 2004

A practical implementation of stochastic programming: an application to the evaluation of option contracts in supply chains.
Autom., 2004

Large-scale convex optimization methods for air quality policy assessment.
Autom., 2004

Efficient Algorithm for Linear Pattern Separation.
Proceedings of the Computational Science, 2004

2003
Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method.
Comput. Optim. Appl., 2003

2002
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method.
Optim. Methods Softw., 2002

2001
Parallel Implementation of a Central Decomposition Method for Solving Large-Scale Planning Problems.
Comput. Optim. Appl., 2001

2000
Multiple Cuts in the Analytic Center Cutting Plane Method.
SIAM J. Optim., 2000

Building and Solving Large-Scale Stochastic Programs on an Affordable Distributed Computing System.
Ann. Oper. Res., 2000

1999
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities.
SIAM J. Optim., 1999

Shallow, deep and very deep cuts in the analytic center cutting plane method.
Math. Program., 1999

A two-cut approach in the analytic center cutting plane method.
Math. Methods Oper. Res., 1999

1998
Computing Maximum Likelihood Estimators of Convex Density Functions.
SIAM J. Sci. Comput., 1998

On Improvements to the Analytic Center Cutting Plane Method.
Comput. Optim. Appl., 1998

Theory and algorithms for linear optimization - an interior point approach.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-95676-1, 1998

1997
A path-following version of the Todd-Burrell procedure for linear programming.
Math. Methods Oper. Res., 1997

1996
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method.
Math. Program., 1996

Long-step primal-dual target-following algorithms for linear programming.
Math. Methods Oper. Res., 1996

Primal-dual target-following algorithms for linear programming.
Ann. Oper. Res., 1996

1995
A cutting plane method from analytic centers for stochastic programming.
Math. Program., 1995

1994
Short Steps with Karmarkar's Projective Algorithm for Linear Programming.
SIAM J. Optim., 1994

Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming.
Discret. Appl. Math., 1994

1993
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm.
Math. Program., 1993

1992
A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming.
SIAM J. Optim., 1992

A polynomial method of approximate centers for linear programming.
Math. Program., 1992

Alternative Approaches to Feasibility in Projective Methods for Linear Programming.
INFORMS J. Comput., 1992

1987
An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex.
Math. Program., 1987

1986
A Polynomial Newton Method for Linear Programming.
Algorithmica, 1986

1983
Strong and Weak Convexity of Sets and Functions.
Math. Oper. Res., 1983

1977
Unconstrained Optimization by Approximation of the Gradient Path.
Math. Oper. Res., 1977


  Loading...