Philippe Mahey

804 total citations
41 papers, 484 citations indexed

About

Philippe Mahey is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Philippe Mahey has authored 41 papers receiving a total of 484 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 13 papers in Computer Networks and Communications and 13 papers in Electrical and Electronic Engineering. Recurrent topics in Philippe Mahey's work include Vehicle Routing Optimization Methods (11 papers), Advanced Optical Network Technologies (11 papers) and Advanced Optimization Algorithms Research (9 papers). Philippe Mahey is often cited by papers focused on Vehicle Routing Optimization Methods (11 papers), Advanced Optical Network Technologies (11 papers) and Advanced Optimization Algorithms Research (9 papers). Philippe Mahey collaborates with scholars based in France, Brazil and Canada. Philippe Mahey's co-authors include Adam Ouorou, Jean-Philippe Vial, Pham Dinh Tao, Larry J. LeBlanc, Henrique Pacca Loureiro Luna, Maurício C. de Souza, Nelson Maculan, Shahin Gelareh, Rahimeh Neamatian Monemi and Christophe Duhamel and has published in prestigious journals such as Management Science, European Journal of Operational Research and Computers & Operations Research.

In The Last Decade

Philippe Mahey

40 papers receiving 466 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Philippe Mahey France 12 181 145 126 105 94 41 484
Adam Ouorou France 12 106 0.6× 137 0.9× 82 0.7× 143 1.4× 86 0.9× 30 438
O. du Merle Switzerland 8 240 1.3× 96 0.7× 55 0.4× 109 1.0× 35 0.4× 10 497
Sourour Elloumi France 13 288 1.6× 187 1.3× 124 1.0× 218 2.1× 66 0.7× 34 653
Cihan H. Tuncbilek United States 7 111 0.6× 232 1.6× 66 0.5× 297 2.8× 60 0.6× 7 553
Matthew J. Saltzman United States 12 222 1.2× 170 1.2× 104 0.8× 130 1.2× 47 0.5× 17 519
Hugues Marchand Belgium 7 265 1.5× 132 0.9× 77 0.6× 47 0.4× 53 0.6× 7 461
Bettina Klinz Austria 11 146 0.8× 177 1.2× 130 1.0× 23 0.2× 59 0.6× 33 516
J. J. H. Forrest United States 11 201 1.1× 216 1.5× 76 0.6× 246 2.3× 85 0.9× 16 670
Renata Sotirov Netherlands 13 117 0.6× 223 1.5× 92 0.7× 142 1.4× 150 1.6× 53 513
Dieter Vandenbussche United States 8 267 1.5× 256 1.8× 48 0.4× 271 2.6× 23 0.2× 11 667

Countries citing papers authored by Philippe Mahey

Since Specialization
Citations

This map shows the geographic impact of Philippe Mahey'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 Philippe Mahey with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philippe Mahey more than expected).

Fields of papers citing papers by Philippe Mahey

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Philippe Mahey. 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 Philippe Mahey. The network helps show where Philippe Mahey may publish in the future.

Co-authorship network of co-authors of Philippe Mahey

This figure shows the co-authorship network connecting the top 25 collaborators of Philippe Mahey. A scholar is included among the top collaborators of Philippe Mahey 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 Philippe Mahey. Philippe Mahey is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Baı̈ou, Mourad, et al.. (2020). Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods. International Transactions in Operational Research. 28(1). 296–326. 3 indexed citations
2.
Duhamel, Christophe, et al.. (2016). Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem. 4OR. 14(2). 201–220. 3 indexed citations
3.
Mahey, Philippe, et al.. (2015). A survey on operator splitting and decomposition of convex programs. RAIRO - Operations Research. 51(1). 17–41. 8 indexed citations
4.
Gelareh, Shahin, Rahimeh Neamatian Monemi, Philippe Mahey, Nelson Maculan, & David Pisinger. (2013). Single string planning problem arising in liner shipping industries: A heuristic approach. Computers & Operations Research. 40(10). 2357–2373. 6 indexed citations
5.
Gelareh, Shahin, Nelson Maculan, Philippe Mahey, & Rahimeh Neamatian Monemi. (2012). Hub-and-spoke network design and fleet deployment for string planning of liner shipping. Applied Mathematical Modelling. 37(5). 3307–3321. 39 indexed citations
6.
Dussault, Jean-Pièrre, et al.. (2012). A robust controller for a two-layered approach applied to the game of billiards. Entertainment Computing. 3(3). 59–70. 4 indexed citations
7.
Duhamel, Christophe, et al.. (2011). Variable neighborhood descent with iterated local search for routing and wavelength assignment. Computers & Operations Research. 39(9). 2133–2141. 18 indexed citations
8.
Mahey, Philippe. (2010). Editorial. A case of plagiarism: retraction of a paper by Sreenivas and Srinivas, Vol. 43, n°4, pp. 331–337. RAIRO - Operations Research. 44(1). 1–3. 2 indexed citations
9.
Mahey, Philippe, et al.. (2009). ACCELERATING CONVERGENCE OF A CLASS OF SPLITTING ALGORITHMS WITH ITERATIVE FOLDINGS. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
10.
Chrétienne, Philippe, et al.. (2006). Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths. European Journal of Operational Research. 185(3). 1390–1401. 25 indexed citations
11.
Mahey, Philippe & Maurício C. de Souza. (2006). Local optimality conditions for multicommodity flow problems with separable piecewise convex costs. Operations Research Letters. 35(2). 221–226. 10 indexed citations
12.
Mahey, Philippe, et al.. (2006). Elastic time computation in QoS-driven hypermedia presentations. Multimedia Systems. 12(6). 461–478. 5 indexed citations
13.
Dussault, Jean-Pièrre, et al.. (2005). Separable Augmented Lagrangian Algorithm with Multidimensional Scaling for Monotropic Programming. Journal of Optimization Theory and Applications. 127(2). 329–345. 3 indexed citations
14.
Ferreira, A., et al.. (2002). An optimization model for routing in low Earth orbit satellite constellations. 161–166. 1 indexed citations
15.
Mahey, Philippe, et al.. (2001). Separable convexification and DCA techniques for capacity and flow assignment problems. RAIRO - Operations Research. 35(2). 269–281. 4 indexed citations
16.
Mahey, Philippe, et al.. (2001). Capacity and flow assignment of data networks by generalized Benders decomposition. Journal of Global Optimization. 20(2). 169–189. 21 indexed citations
17.
Luna, Henrique Pacca Loureiro & Philippe Mahey. (2000). Bounds for global optimization of capacity expansion and flow assignment problems. Operations Research Letters. 26(5). 211–216. 15 indexed citations
18.
Mahey, Philippe, et al.. (1998). Iterative improvement methods for a multiperiod network design problem. European Journal of Operational Research. 110(1). 150–165. 12 indexed citations
19.
Mahey, Philippe, et al.. (1998). A new proximal decomposition algorithm for routing in telecommunication networks. Networks. 31(4). 227–238. 30 indexed citations
20.
Lasserre, Jean B. & Philippe Mahey. (1989). Using linear programming in Petri net analysis. RAIRO - Operations Research. 23(1). 43–50. 2 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

Rankless by CCL
2026