On a negative-equivalency theorem in associative optimal path problems (Q4500803): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An Algebra for Network Routing Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: From dynamic programming to bynamic programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shortest and longest path problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new look at Bellman's principle of optimality / rank | |||
Normal rank |
Latest revision as of 13:27, 30 May 2024
scientific article; zbMATH DE number 1496743
Language | Label | Description | Also known as |
---|---|---|---|
English | On a negative-equivalency theorem in associative optimal path problems |
scientific article; zbMATH DE number 1496743 |
Statements
On a negative-equivalency theorem in associative optimal path problems (English)
0 references
22 March 2004
0 references
bitonic semigroup
0 references
negative-equivalency theorem
0 references