ON ASSOCIATIVE SHORTEST PATH PROBLEMS

DOI 機関リポジトリ (HANDLE) 被引用文献1件 オープンアクセス

この論文をさがす

説明

We consider a wide class of shortest path problems in acyclic digraphs. In the problems, the length of a path is defined by using an associative binary operation. We derive recursive equations in dynamic programming for the problems, which involve additive, multiplicative, multiplicative-additive, minimum and fractional shortest path problems. A necessary and sufficient condition and two sufficient conditions for the recursive equation to have a solution are given because for all problems the recursive equation does not hold. In case the equation has a solution, a sequence which converges to the solution is proposed.

収録刊行物

被引用文献 (1)*注記

もっと見る

キーワード

詳細情報 詳細情報について

  • CRID
    1390290699825817856
  • NII論文ID
    120001151115
  • NII書誌ID
    AA10634475
  • DOI
    10.5109/13462
  • ISSN
    2435743X
    0286522X
  • HANDLE
    2324/13462
  • 本文言語コード
    en
  • 資料種別
    journal article
  • データソース種別
    • JaLC
    • IRDB
    • Crossref
    • CiNii Articles
    • OpenAIRE
  • 抄録ライセンスフラグ
    使用可

問題の指摘

ページトップへ