Dynamic programming approaches for the traveling salesman problem with drone
Abstract
loading...
About
In The Last Decade
doi.org/10.1002/net.21864 →Countries where authors are citing Dynamic programming approaches for the traveling salesman problem with drone
This map shows the geographic impact of Dynamic programming approaches for the traveling salesman problem with drone. 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 Dynamic programming approaches for the traveling salesman problem with drone with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dynamic programming approaches for the traveling salesman problem with drone more than expected).
Fields of papers citing Dynamic programming approaches for the traveling salesman problem with drone
This network shows the impact of Dynamic programming approaches for the traveling salesman problem with drone. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Dynamic programming approaches for the traveling salesman problem with drone.
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.
This paper is also available at doi.org/10.1002/net.21864.