Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
20061.6k citationsStefan Røpke, David PisingerTransportation Scienceprofile →
Knapsack Problems
20041.2k citationsUlrich Pferschy, David Pisinger et al.profile →
A general heuristic for vehicle routing problems
2005968 citationsDavid Pisinger, Stefan RøpkeComputers & Operations Researchprofile →
Countries citing papers authored by David Pisinger
Since
Specialization
Citations
This map shows the geographic impact of David Pisinger'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 David Pisinger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Pisinger more than expected).
This network shows the impact of papers produced by David Pisinger. 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 David Pisinger. The network helps show where David Pisinger may publish in the future.
Co-authorship network of co-authors of David Pisinger
This figure shows the co-authorship network connecting the top 25 collaborators of David Pisinger.
A scholar is included among the top collaborators of David Pisinger 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 David Pisinger. David Pisinger is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Pisinger, David, et al.. (2019). Liner shipping disruption management in practice: Generating recovery plans for vessels and cargo.
9.
Plum, Christian Edinger Munk, David Pisinger, Juan‐José Salazar‐González, & Mikkel M. Sigurd. (2012). The Multi-commodity One-to-one Pickup-and-delivery Traveling Salesman Problem with Path Duration Limits. Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU). 1578–1581.2 indexed citations
10.
Plum, Christian Edinger Munk, et al.. (2012). Bunker Purchasing with Contracts.1 indexed citations
11.
Jepsen, Mads Kehlet, Berit Dangaard Brouer, Christian Edinger Munk Plum, David Pisinger, & Mikkel M. Sigurd. (2011). A Path Based Model for a Green Liner Shipping Network Design Problem. Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU). 1379–1384.12 indexed citations
Røpke, Stefan & David Pisinger. (2006). An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transportation Science. 40(4). 455–472.1626 indexed citations breakdown →
Pisinger, David & Stefan Røpke. (2005). A general heuristic for vehicle routing problems. Computers & Operations Research. 34(8). 2403–2435.968 indexed citations breakdown →
Pisinger, David. (1999). A Tree Search Heuristic for the Container Loading Problem. Research at the University of Copenhagen (University of Copenhagen).4 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.