On a routing problem.

Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 87-90.

Type

Journal article

Intellectual base

Primary research

Year

1958

Pages

87-90

DOI registrant

American Mathematical Society

Link

https://doi.org/10.1090/qam/102435matched

Cited from

operations_research

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Network Flow Models
  • Listed in the references but not attached to a specific claim.

Domain-specific

• Bellman Equation
  • Operations research — its founding application area: inventory control, optimal stopping, and network shortest paths via the Bellman-Ford relaxation

    This sourceBellman's shortest-path recursion, the 'Bellman' half of Bellman-Ford.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:449186c29d9b · see in the full table