Bjørn Petersen
About
In The Last Decade
Bjørn Petersen
11 papers receiving 416 citations
Peers
Comparison fields: 5 of 48
- Industrial and Manufacturing Engineering 360
- Automotive Engineering 204
- Building and Construction 114
- Transportation 82
- Electrical and Electronic Engineering 44
Countries citing papers authored by Bjørn Petersen
This map shows the geographic impact of Bjørn Petersen'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 Bjørn Petersen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bjørn Petersen more than expected).
Fields of papers citing papers by Bjørn Petersen
This network shows the impact of papers produced by Bjørn Petersen. 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 Bjørn Petersen. The network helps show where Bjørn Petersen may publish in the future.
Co-authorship network of co-authors of Bjørn Petersen
This figure shows the co-authorship network connecting the top 25 collaborators of Bjørn Petersen. A scholar is included among the top collaborators of Bjørn Petersen 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 Bjørn Petersen. Bjørn Petersen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 5 | |
| 2 | 19 | |
| 3 | 14 | |
| 4 | 48 | |
| 5 | Shortest Paths and Vehicle Routing | 3 |
| 6 | 9 | |
| 7 | A Branch-and-Cut Algorithm for the Elementary Shortest Path Problem with a Capacity Constraint | 17 |
| 8 | 293 | |
| 9 | Optimal Routing with Single Backup Path Protection | 10 |
| 10 | A non-robust Branch-and-Cut-and-Price algorithm for the Vehicle Routing Problem with Time Windows | 17 |
| 11 | 2 |
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.