J.‐P. Vial

1.8k total citations
30 papers, 1.1k citations indexed

About

J.‐P. Vial is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Industrial and Manufacturing Engineering. According to data from OpenAlex, J.‐P. Vial has authored 30 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Numerical Analysis, 13 papers in Computational Theory and Mathematics and 11 papers in Industrial and Manufacturing Engineering. Recurrent topics in J.‐P. Vial's work include Advanced Optimization Algorithms Research (17 papers), Vehicle Routing Optimization Methods (6 papers) and Optimization and Packing Problems (6 papers). J.‐P. Vial is often cited by papers focused on Advanced Optimization Algorithms Research (17 papers), Vehicle Routing Optimization Methods (6 papers) and Optimization and Packing Problems (6 papers). J.‐P. Vial collaborates with scholars based in Switzerland, Canada and France. J.‐P. Vial's co-authors include Jean‐Louis Goffin, Alain Haurie, Hervé Moulin, O. du Merle, Tamás Terlaky, C. Roos, Jacek Gondzio, Olivier Bahn, Frédéric Babonneau and Adam Ouorou and has published in prestigious journals such as Management Science, Automatica and European Journal of Operational Research.

In The Last Decade

J.‐P. Vial

30 papers receiving 952 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
J.‐P. Vial Switzerland	21	453	402	223	216	161	30	1.1k
Michael M. Kostreva United States	17	310 0.7×	409 1.0×	194 0.9×	212 1.0×	186 1.2×	75	1.0k
Jean‐Louis Goffin Canada	18	571 1.3×	503 1.3×	296 1.3×	80 0.4×	169 1.0×	42	1.1k
Irvin J. Lustig United States	16	659 1.5×	595 1.5×	258 1.2×	186 0.9×	282 1.8×	25	1.3k
Richard V. Helgason United States	13	210 0.5×	232 0.6×	315 1.4×	128 0.6×	278 1.7×	21	1.3k
Faiz Al-Khayyal United States	16	476 1.1×	405 1.0×	362 1.6×	86 0.4×	416 2.6×	32	1.3k
Pierre Bonami France	16	520 1.1×	434 1.1×	239 1.1×	256 1.2×	534 3.3×	34	1.5k
Tomomi Matsui Japan	17	237 0.5×	413 1.0×	234 1.0×	454 2.1×	155 1.0×	82	1.1k
Jean-Philippe Vial Switzerland	21	848 1.9×	915 2.3×	235 1.1×	388 1.8×	448 2.8×	60	2.2k
Jeffery L. Kennington United States	18	178 0.4×	210 0.5×	290 1.3×	257 1.2×	184 1.1×	48	1.2k
Georg Still Netherlands	17	638 1.4×	753 1.9×	68 0.3×	210 1.0×	390 2.4×	62	1.2k

Countries citing papers authored by J.‐P. Vial

Since Specialization

Citations

This map shows the geographic impact of J.‐P. Vial's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by J.‐P. Vial with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J.‐P. Vial more than expected).

Fields of papers citing papers by J.‐P. Vial

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by J.‐P. Vial. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by J.‐P. Vial. The network helps show where J.‐P. Vial may publish in the future.

Co-authorship network of co-authors of J.‐P. Vial

This figure shows the co-authorship network connecting the top 25 collaborators of J.‐P. Vial. A scholar is included among the top collaborators of J.‐P. Vial based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with J.‐P. Vial. J.‐P. Vial is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Liao, Sumei, et al.. (2012). Distributionally robust workforce scheduling in call centres with uncertain arrival rates. Optimization methods & software. 28(3). 501–522. 21 indexed citations

Babonneau, Frédéric & J.‐P. Vial. (2007). ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Mathematical Programming. 120(1). 179–210. 20 indexed citations

Ouorou, Adam & J.‐P. Vial. (2007). A model for robust capacity planning for telecommunications networks under demand uncertainty. 1–4. 22 indexed citations

Babonneau, Frédéric, O. du Merle, & J.‐P. Vial. (2006). Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM. Operations Research. 54(1). 184–197. 28 indexed citations

Roos, C., Tamás Terlaky, & J.‐P. Vial. (2005). Interior Point Methods for Linear Optimization. CERN Document Server (European Organization for Nuclear Research). 108 indexed citations

Carlson, Dean A., et al.. (2003). Large-scale convex optimization methods for air quality policy assessment. Automatica. 40(3). 385–395. 21 indexed citations

Vial, J.‐P., et al.. (1999). Warm Start and ε-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs. Computational Optimization and Applications. 14(1). 17–36. 22 indexed citations

Bahn, Olivier, Alain Haurie, Socrates Kypreos, & J.‐P. Vial. (1998). Advanced mathematical programming modeling to assess the benefits from international CO2 abatement cooperation. Environmental Modeling & Assessment. 3(1-2). 107–115. 17 indexed citations

Merle, O. du, Jean‐Louis Goffin, & J.‐P. Vial. (1998). On Improvements to the Analytic Center Cutting Plane Method. Computational Optimization and Applications. 11(1). 37–52. 29 indexed citations

10.

Gondzio, Jacek, et al.. (1997). Using an interior point method for the master problem in a decomposition approach. European Journal of Operational Research. 101(3). 577–587. 17 indexed citations

11.

Gondzio, Jacek, et al.. (1996). ACCPM — A library for convex optimization based on an analytic center cutting plane method. European Journal of Operational Research. 94(1). 206–211. 32 indexed citations

12.

Bahn, Olivier, Jean‐Louis Goffin, J.‐P. Vial, & O. du Merle. (1994). Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming. Discrete Applied Mathematics. 49(1-3). 3–23. 35 indexed citations

13.

Vial, J.‐P.. (1994). Computational experience with a primal-dual interior-point method for smooth convex programming. Optimization methods & software. 3(4). 285–310. 26 indexed citations

14.

Jansen, Benjamin, C. Roos, Tamás Terlaky, & J.‐P. Vial. (1994). Primal-dual algorithms for linear programming based on the logarithmic barrier method. Journal of Optimization Theory and Applications. 83(1). 1–26. 24 indexed citations

15.

Goffin, Jean‐Louis & J.‐P. Vial. (1993). On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. Mathematical Programming. 60(1-3). 81–92. 31 indexed citations

16.

Goffin, Jean‐Louis, Alain Haurie, & J.‐P. Vial. (1992). Decomposition and Nondifferentiable Optimization with the Projective Algorithm. Management Science. 38(2). 284–302. 145 indexed citations

17.

Todd, Michael J. & J.‐P. Vial. (1992). Todd's low-complexity algorithm is a predictor-corrector path-following method. Operations Research Letters. 11(4). 199–207. 3 indexed citations

18.

Goffin, Jean‐Louis & J.‐P. Vial. (1990). Cutting planes and column generation techniques with the projective algorithm. Journal of Optimization Theory and Applications. 65(3). 409–429. 43 indexed citations

19.

Vial, J.‐P., et al.. (1986). A polynomial newton method for linear programming. Algorithmica. 1(1-4). 425–453. 76 indexed citations

20.

Vial, J.‐P., et al.. (1985). A restricted trust region algorithm for unconstrained optimization. Journal of Optimization Theory and Applications. 47(4). 413–435. 12 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact