Jean-Philippe Vial

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