- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
ON ASSOCIATIVE SHORTEST PATH PROBLEMS
-
- Maruyama Yukihiro
- Department of Mathematics, Faculty of Liberal Arts, Nagasaki University
Search this article
Description
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.
Journal
-
- Bulletin of informatics and cybernetics
-
Bulletin of informatics and cybernetics 29 (1), 67-81, 1997-03
Research Association of Statistical Sciences
- Tweet
Details 詳細情報について
-
- CRID
- 1390290699825817856
-
- NII Article ID
- 120001151115
-
- NII Book ID
- AA10634475
-
- DOI
- 10.5109/13462
-
- ISSN
- 2435743X
- 0286522X
-
- HANDLE
- 2324/13462
-
- Text Lang
- en
-
- Article Type
- journal article
-
- Data Source
-
- JaLC
- IRDB
- Crossref
- CiNii Articles
- OpenAIRE
-
- Abstract License Flag
- Allowed
