Reference health

Dynamic Programming Approaches for the Traveling Salesman Problem with Drone

https://doi.org/10.2139/ssrn.3035323
CiteStamped reference-health badge
15/15 checkable references clean · checked 2026-08-28

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

7 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 15 checked references that resolve
resolves10.1287/trsc.2017.0791
Optimization Approaches for the Traveling Salesman Problem with Drone
resolves10.1145/321105.321111
Dynamic Programming Treatment of the Travelling Salesman Problem
resolves10.1287/mnsc.2017.2824
Coordinated Logistics with a Truck and a Drone
resolves10.1145/3828.3830
Generalized best-first search strategies and the optimality of A*
resolves10.3926/jiem.1929
Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm
resolves10.1109/tssc.1968.300136
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
resolves10.1137/0110015
A Dynamic Programming Approach to Sequencing Problems
resolves10.1287/trsc.1100.0331
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation
resolves10.1287/trsc.26.3.185
Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
resolves10.1016/0377-2217(94)00299-1
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
resolves10.1287/opre.45.3.365
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
resolves10.1016/j.trc.2015.03.005
The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery
resolves10.1002/net.21746
The vehicle routing problem with drones: Extended models and connections
resolves10.1287/trsc.14.2.130
A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem
resolves10.1007/s11590-016-1035-3
The vehicle routing problem with drones: several worst-case results
The 7 references without a DOI — listed, not checked
no DOI — not checkedref2
no DOI — not checkedref5
no DOI — not checkedref8
no DOI — not checkedCorrection to a formal basis for the heuristic determination of minimum cost paths
no DOI — not checkedref17
no DOI — not checkedref19
no DOI — not checkedref21
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-08-28 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.2139/ssrn.3035323"><img src="https://citestamp.com/citestamped/10.2139/ssrn.3035323/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.2139/ssrn.3035323/badge.svg)](https://citestamp.com/citestamped/10.2139/ssrn.3035323)