Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
J.‐P. Vial
Observed names:
J. -P. Vial,
J. P. Vial,
J.-P Vial,
J.-P. Vial,
J.-Ph. Vial,
J.P. Vial,
Jean -Philippe Vial,
Jean-Philippe Vial,
Vial, J.-P.,
Vial, J.P.
show all 10
Institution:
University of Geneva
Observed institutions:
University of Geneva,
Ordecsys (Switzerland),
École Polytechnique Fédérale de Lausanne,
University of Genoa,
UCLouvain,
KU Leuven
show all 6
OpenAlex ID:
A5113460346
Deriving robust counterparts of nonlinear uncertain inequalities
2014
·
Aharon Ben-Tal
, Dick den Hertog
, et al.
·
Mathematical Programming
·
254
Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
1978
·
H. Moulin
, J. -P. Vial
·
International Journal of Game Theory
·
236
Decomposition and Nondifferentiable Optimization with the Projective Algorithm
1992
·
J. L. Goffin
, A. Haurie
, et al.
·
Management Science
·
199
A polynomial newton method for linear programming
1986
·
Guy de Ghellinck
, Jean -Philippe Vial
·
Algorithmica
·
140
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
1997
·
J. -L. Goffin
, J. Gondzio
, et al.
·
Mathematical Programming
·
122
PDF
A cutting plane method from analytic centers for stochastic programming
1995
·
O. Bahn
, O. du Merle
, et al.
·
Mathematical Programming
·
79
Cutting planes and column generation techniques with the projective algorithm
1990
·
J. L. Goffin
, J. P. Vial
·
Journal of Optimization Theory and Applications
·
67
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
1993
·
J. L. Goffin
, J. P. Vial
·
Mathematical Programming
·
59
ACCPM — A library for convex optimization based on an analytic center cutting plane method
1996
·
J. Gondzio
, O. du Merle
, et al.
·
European Journal of Operational Research
·
56
Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming
1994
·
O. Bahn
, J.L. Goffin
, et al.
·
Discrete Applied Mathematics
·
49
Robust Optimization for Environmental and Energy Planning
2009
·
F. Babonneau
, J.-P. Vial
, et al.
·
International series in management science/operations research/International series in operations research & management science
·
47
Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
2006
·
F. Babonneau
, O. du Merle
, et al.
·
Operations Research
·
45
A model for robust capacity planning for telecommunications networks under demand uncertainty
2007
·
A. Ouorou
, J.-Ph. Vial
·
International Conference on the Design of Reliable Communication Networks (DRCN)
·
42
Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
2010
·
C. Beltran-Royo
, J.-P. Vial
, et al.
·
Computational Optimization and Applications
·
38
Large-scale convex optimization methods for air quality policy assessment
2003
·
D.A. Carlson
, A. Haurie
, et al.
·
Automatica
·
38
On Improvements to the Analytic Center Cutting Plane Method
1998
·
O. du Merle
, J.-L. Goffin
, et al.
·
Computational Optimization and Applications
·
36
Primal-dual algorithms for linear programming based on the logarithmic barrier method
1994
·
B. Jansen
, C. Roos
, et al.
·
Journal of Optimization Theory and Applications
·
35
Distributionally robust workforce scheduling in call centres with uncertain arrival rates
2012
·
S. Liao
, C. van Delft
, et al.
·
Optimization methods & software
·
33
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
2007
·
F. Babonneau
, J.-P. Vial
·
Mathematical Programming
·
31
Discounted costs, obsolescence and planned stockouts with the EOQ formula
1996
·
Ch. van Delft
, J.P. Vial
·
International Journal of Production Economics
·
30
Warm Start and ε-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs
1999
·
J. Gondizo
, J.-P Vial
·
Computational Optimization and Applications
·
29
Computational experience with a primal-dual interior-point method for smooth convex programming
1994
·
J.P. Vial
·
Optimization methods & software
·
29
Convex Nondifferentiable Optimization: a Survey Focussed on the Analytic Center Cutting Plane Method
1999
·
Jean‐Louis Goffin
, J.‐P. Vial
·
25
Robust capacity assignment solutions for telecommunications networks with uncertain demands
2013
·
F. Babonneau
, J.‐P. Vial
, et al.
·
Networks
·
24
Using an interior point method for the master problem in a decomposition approach
1997
·
J. Gondzio
, R. Sarkissian
, et al.
·
European Journal of Operational Research
·
23
Show more works
View as search
Works count:
52
Citation count:
1,919
H-index:
24
I10-index:
31
Year
Topic
Type
