default search action
Jean-Philippe Vial
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j51]Frédéric Babonneau, Denis Gilbert, Olivier Piller
, Jean-Philippe Vial:
Robust optimal design of a tree-based water distribution network with intermittent demand. Eur. J. Oper. Res. 319(3): 834-844 (2024) - [i1]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 abs/2407.17329 (2024)
2010 – 2019
- 2019
- [j50]Frédéric Babonneau
NeatWork: A Tool for the Design of Gravity-Driven Water Distribution Systems for Poor Rural Communities. INFORMS J. Appl. Anal. 49(2): 129-136 (2019) - 2017
- [j49]Aharon Ben-Tal, Ruud Brekelmans, Dick den Hertog, Jean-Philippe Vial:
Globalized Robust Optimization for Nonlinear Uncertain Inequalities. INFORMS J. Comput. 29(2): 350-366 (2017) - 2015
- [j48]Aharon Ben-Tal, Dick den Hertog, Jean-Philippe Vial:
Deriving robust counterparts of nonlinear uncertain inequalities. Math. Program. 149(1-2): 265-299 (2015) - 2014
- [c4]Jean-Philippe Vial:
Robust Optimization. ICORES 2014: IS-11 - 2013
- [j47]Frédéric Babonneau
Robust capacity assignment solutions for telecommunications networks with uncertain demands. Networks 62(4): 255-272 (2013) - [j46]Shuangqing Liao, Christian van Delft, Jean-Philippe Vial:
Distributionally robust workforce scheduling in call centres with uncertain arrival rates. Optim. Methods Softw. 28(3): 501-522 (2013) - 2012
- [j45]Cesar Beltran-Royo
Semi-Lagrangian relaxation applied to the uncapacitated facility location problem. Comput. Optim. Appl. 51(1): 387-409 (2012) - [j44]Frédéric Babonneau
Design and Operations of Gas Transmission Networks. Oper. Res. 60(1): 34-47 (2012) - 2010
- [j43]Frédéric Babonneau
A partitioning algorithm for the network loading problem. Eur. J. Oper. Res. 204(1): 173-179 (2010)
2000 – 2009
- 2009
- [j42]Frédéric Babonneau
Test Instances for the Multicommodity Flow Problem: An Erratum. Oper. Res. 57(4): 1045 (2009) - [j41]Frédéric Babonneau
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Math. Program. 120(1): 179-210 (2009) - [j40]Frédéric Babonneau
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum. Math. Program. 120(1): 211-212 (2009) - [r2]Samir Elhedhli, Jean-Louis Goffin, Jean-Philippe Vial:
Nondifferentiable Optimization. Encyclopedia of Optimization 2009: 2584-2590 - [r1]Samir Elhedhli, Jean-Louis Goffin, Jean-Philippe Vial:
Nondifferentiable Optimization: Cutting Plane Methods. Encyclopedia of Optimization 2009: 2590-2595 - 2008
- [j39]Yurii E. Nesterov, Jean-Philippe Vial:
Confidence level solutions for stochastic programming. Autom. 44(6): 1559-1568 (2008) - [j38]Julien Thénié, Jean-Philippe Vial:
Step decision rules for multistage stochastic programming: A heuristic approach. Autom. 44(6): 1569-1584 (2008) - [j37]Laurent Drouet
An oracle based method to compute a coupled equilibrium in a model of international climate policy. Comput. Manag. Sci. 5(1-2): 119-140 (2008) - [j36]Frédéric Babonneau
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands. Transp. Sci. 42(2): 249-260 (2008) - 2007
- [j35]Julien Thénié, Christian van Delft, Jean-Philippe Vial:
Automatic Formulation of Stochastic Programs Via an Algebraic Modeling Language. Comput. Manag. Sci. 4(1): 17-40 (2007) - [c3]Adam Ouorou, Jean-Philippe Vial:
A model for robust capacity planning for telecommunications networks under demand uncertainty. DRCN 2007: 1-4 - 2006
- [j34]Cesar Beltran
Solving the p -Median Problem with a Semi-Lagrangian Relaxation. Comput. Optim. Appl. 35(2): 239-260 (2006) - [j33]Frédéric Babonneau
Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM. Oper. Res. 54(1): 184-197 (2006) - 2005
- [j32]Aharon Ben-Tal, Boaz Golany, Arkadi Nemirovski
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach. Manuf. Serv. Oper. Manag. 7(3): 248-271 (2005) - 2004
- [j31]Dean A. Carlson, Alain Haurie, Jean-Philippe Vial, Daniel S. Zachary:
Large-scale convex optimization methods for air quality policy assessment. Autom. 40(3): 385-395 (2004) - [j30]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): 743-756 (2004) - [j29]Yurii E. Nesterov, Jean-Philippe Vial:
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. Math. Program. 99(1): 149-174 (2004) - [c2]Claude Tadonki, Jean-Philippe Vial:
Efficient Algorithm for Linear Pattern Separation. International Conference on Computational Science 2004: 679-682 - 2003
- [j28]Olivier Péton
Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method. Comput. Optim. Appl. 24(1): 37-61 (2003) - 2002
- [j27]Jean-Louis Goffin, Jean-Philippe Vial:
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17(5): 805-867 (2002) - 2001
- [j26]Jacek Gondzio
Parallel Implementation of a Central Decomposition Method for Solving Large-Scale Planning Problems. Comput. Optim. Appl. 19(1): 5-29 (2001) - 2000
- [j25]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): 167-187 (2000) - [j24]Jean-Louis Goffin, Jean-Philippe Vial:
Multiple Cuts in the Analytic Center Cutting Plane Method. SIAM J. Optim. 11(1): 266-288 (2000) - [c1]Jerzy A. Filar
Decomposition and parallel processing techniques for two-time scale controlled Markov chains. CDC 2000: 711-716
1990 – 1999
- 1999
- [j23]J. Gondizo, Jean-Philippe Vial:
Warm Start and ε-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs. Comput. Optim. Appl. 14(1): 17-36 (1999) - [j22]Jean-Louis Goffin, Jean-Philippe Vial:
A two-cut approach in the analytic center cutting plane method. Math. Methods Oper. Res. 49(1): 149-169 (1999) - [j21]Jean-Louis Goffin, Jean-Philippe Vial:
Shallow, deep and very deep cuts in the analytic center cutting plane method. Math. Program. 84(1): 89-103 (1999) - [j20]Yurii E. Nesterov, Jean-Philippe Vial:
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities. SIAM J. Optim. 9(3): 707-728 (1999) - 1998
- [b1]Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Theory and algorithms for linear optimization - an interior point approach. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1998, ISBN 978-0-471-95676-1, pp. I-XXIV, 1-482 - [j19]Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial:
On Improvements to the Analytic Center Cutting Plane Method. Comput. Optim. Appl. 11(1): 37-52 (1998) - [j18]Tamás Terlaky, Jean-Philippe Vial:
Computing Maximum Likelihood Estimators of Convex Density Functions. SIAM J. Sci. Comput. 19(2): 675-694 (1998) - 1997
- [j17]Jean-Philippe Vial:
A path-following version of the Todd-Burrell procedure for linear programming. Math. Methods Oper. Res. 46(2): 153-167 (1997) - 1996
- [j16]Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial:
Primal-dual target-following algorithms for linear programming. Ann. Oper. Res. 62(1): 197-231 (1996) - [j15]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): 11-30 (1996) - [j14]Jean-Louis Goffin, Jacek Gondzio
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Program. 76: 131-154 (1996) - 1995
- [j13]Olivier Bahn, Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial:
A cutting plane method from analytic centers for stochastic programming. Math. Program. 69: 45-73 (1995) - 1994
- [j12]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): 3-23 (1994) - [j11]Jean-Louis Goffin, Jean-Philippe Vial:
Short Steps with Karmarkar's Projective Algorithm for Linear Programming. SIAM J. Optim. 4(1): 193-207 (1994) - 1993
- [j10]Jean-Louis Goffin, Jean-Philippe Vial:
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. Math. Program. 60: 81-92 (1993) - 1992
- [j9]Chris Fraley, Jean-Philippe Vial:
Alternative Approaches to Feasibility in Projective Methods for Linear Programming. INFORMS J. Comput. 4(3): 285-299 (1992) - [j8]Kees Roos, Jean-Philippe Vial:
A polynomial method of approximate centers for linear programming. Math. Program. 54: 295-305 (1992) - [j7]Michael J. Todd, Jean-Philippe Vial:
Todd's low-complexity algorithm is a predictor-corrector path-following method. Oper. Res. Lett. 11(4): 199-207 (1992) - [j6]Jean-Philippe Vial:
A projective algorithm for linear programming with no regularity condition. Oper. Res. Lett. 12(1): 1-2 (1992) - [j5]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): 71-87 (1992)
1980 – 1989
- 1987
- [j4]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): 79-92 (1987) - 1986
- [j3]Guy de Ghellinck, Jean-Philippe Vial:
A Polynomial Newton Method for Linear Programming. Algorithmica 1(4): 425-453 (1986) - 1983
- [j2]Jean-Philippe Vial:
Strong and Weak Convexity of Sets and Functions. Math. Oper. Res. 8(2): 231-259 (1983)
1970 – 1979
- 1977
- [j1]Jean-Philippe Vial, Israel Zang:
Unconstrained Optimization by Approximation of the Gradient Path. Math. Oper. Res. 2(3): 253-265 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: