ASSOCIATIVE SHORTEST AND LONGEST PATH PROBLEMS
スポンサーリンク
概要
- 論文の詳細を見る
In the paper we consider a wide class of shortest path problems where the length of a path is defined through various associative binary operations. Solving a system of two interrelated recursive equations, we simultaneously find both shortest and longest path lengths. We show the existence and uniqueness of the solution of the system. Further, we propose an algorithm which solves the class of shortest path problems.
- Research Association of Statistical Sciencesの論文
Research Association of Statistical Sciences | 論文
- CLUSTERING BY A FUZZY METRIC : APPLICATIONS TO THE CLUSTER-MEDIAN PROBLEM
- A FAMILY OF REGRESSION MODELS HAVING PARTIALLY ADDITIVE AND MULTIPLICATIVE COVARIATE STRUCTURE
- AN OPTIMAL STOPPING PROBLEM ON TREE
- ON THE ORDERS OF MAX-MIN FUNCTIONALS
- TREE EXPRESSIONS AND THEIR PRODUCT FORMULA