Michaël Poss

1.6k total citations
69 papers, 982 citations indexed

About

Michaël Poss is a scholar working on Management Science and Operations Research, Industrial and Manufacturing Engineering and Electrical and Electronic Engineering. According to data from OpenAlex, Michaël Poss has authored 69 papers receiving a total of 982 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Management Science and Operations Research, 20 papers in Industrial and Manufacturing Engineering and 16 papers in Electrical and Electronic Engineering. Recurrent topics in Michaël Poss's work include Risk and Portfolio Optimization (25 papers), Optimization and Mathematical Programming (13 papers) and Vehicle Routing Optimization Methods (11 papers). Michaël Poss is often cited by papers focused on Risk and Portfolio Optimization (25 papers), Optimization and Mathematical Programming (13 papers) and Vehicle Routing Optimization Methods (11 papers). Michaël Poss collaborates with scholars based in France, Austria and Brazil. Michaël Poss's co-authors include Bernard Fortz, Agostinho Agra, Artur Alves Pessoa, Rosa Figueiredo, Marielle Christiansen, Lars Magnus Hvattum, Cristina Requejo, Pierre Ladevèze, Dritan Nace and Luı́s Gouveia and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Operations Research.

In The Last Decade

Michaël Poss

65 papers receiving 950 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Michaël Poss France 18 383 254 211 191 132 69 982
Ragheb Rahmaniani Iran 9 338 0.9× 117 0.5× 151 0.7× 179 0.9× 71 0.5× 14 788
Ted K. Ralphs United States 16 478 1.2× 138 0.5× 149 0.7× 110 0.6× 196 1.5× 34 1.0k
Karla Hoffman United States 15 482 1.3× 206 0.8× 123 0.6× 77 0.4× 191 1.4× 46 1.0k
Marco E. Lübbecke Germany 15 798 2.1× 224 0.9× 136 0.6× 145 0.8× 272 2.1× 41 1.3k
Massimiliano Caramia Italy 19 540 1.4× 373 1.5× 156 0.7× 77 0.4× 160 1.2× 90 1.2k
Weijun Xie United States 16 123 0.3× 391 1.5× 281 1.3× 243 1.3× 42 0.3× 59 965
Markus Sinnl Austria 13 315 0.8× 123 0.5× 104 0.5× 97 0.5× 125 0.9× 46 799
François Vanderbeck France 17 943 2.5× 160 0.6× 89 0.4× 120 0.6× 198 1.5× 31 1.2k
Kaj Holmberg Sweden 19 622 1.6× 101 0.4× 215 1.0× 187 1.0× 350 2.7× 70 1.3k
Hongtao Lei China 14 354 0.9× 66 0.3× 180 0.9× 196 1.0× 66 0.5× 30 759

Countries citing papers authored by Michaël Poss

Since Specialization
Citations

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

Fields of papers citing papers by Michaël Poss

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Michaël Poss

This figure shows the co-authorship network connecting the top 25 collaborators of Michaël Poss. A scholar is included among the top collaborators of Michaël Poss 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 Michaël Poss. Michaël Poss 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.
Grangé, Camille, et al.. (2024). Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems. European Journal of Operational Research. 320(3). 516–526.
2.
Grangé, Camille, et al.. (2024). An introduction to variational quantum algorithms for combinatorial optimization problems. Annals of Operations Research. 343(2). 847–884. 2 indexed citations
3.
Fortz, Bernard, et al.. (2023). Loads scheduling for demand response in energy communities. Computers & Operations Research. 160. 106358–106358. 8 indexed citations
4.
Grangé, Camille, et al.. (2023). An introduction to variational quantum algorithms for combinatorial optimization problems. 4OR. 21(3). 363–403. 6 indexed citations
5.
Pessoa, Artur Alves, Michaël Poss, Ruslan Sadykov, & François Vanderbeck. (2021). Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. Operations Research. 69(3). 739–754. 17 indexed citations
6.
Goldberg, Noam & Michaël Poss. (2021). Linearized formulations for failure aware barter exchange. Optimization Letters. 16(4). 1301–1313.
7.
Poss, Michaël, et al.. (2019). Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty. European Journal of Operational Research. 283(1). 70–82. 8 indexed citations
8.
Ouorou, Adam, et al.. (2019). Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
9.
Nace, Dritan, et al.. (2019). Proportional and maxmin fairness for the sensor location problem with chance constraints. Discrete Applied Mathematics. 261. 316–331. 4 indexed citations
10.
Figueiredo, Rosa, et al.. (2019). Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach. Optimization Letters. 14(1). 209–227. 9 indexed citations
11.
Pugliese, Luigi Di Puglia, Francesca Guerriero, & Michaël Poss. (2019). The Resource Constrained Shortest Path Problem with uncertain data: A robust formulation and optimal solution approach. Computers & Operations Research. 107. 140–155. 18 indexed citations
12.
Poss, Michaël, et al.. (2019). Distributionally robust airline fleet assignment problem. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
13.
Poss, Michaël, et al.. (2018). Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing. Networks. 72(1). 151–170. 5 indexed citations
14.
Bougeret, Marin, Artur Alves Pessoa, & Michaël Poss. (2018). Robust scheduling with budgeted uncertainty. Discrete Applied Mathematics. 261. 93–107. 26 indexed citations
15.
Poss, Michaël. (2017). Robust combinatorial optimization with knapsack uncertainty. Discrete Optimization. 27. 88–102. 17 indexed citations
16.
Mattia, Sara & Michaël Poss. (2017). A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation. Computational Optimization and Applications. 69(3). 753–800. 11 indexed citations
17.
Pióro, Michał, et al.. (2016). Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity. Operations Research. 64(2). 273–289. 17 indexed citations
18.
Destercke, Sébastien, Marie-Hélène Masson, & Michaël Poss. (2015). Cautious label ranking with label-wise decomposition. European Journal of Operational Research. 246(3). 927–935. 8 indexed citations
19.
Agra, Agostinho, Marielle Christiansen, Rosa Figueiredo, et al.. (2012). The robust vehicle routing problem with time windows. Computers & Operations Research. 40(3). 856–866. 146 indexed citations
20.
Johnson, Stephen R., Ramesh Padmanabha, Wayne Vaccaro, et al.. (2007). A Simple Strategy for Mitigating the Effect of Data Variability on the Identification of Active Chemotypes from High-Throughput Screening Data. SLAS DISCOVERY. 12(2). 276–284. 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