SCOPUS 정보 검색 플랫폼

Mathematical Programming

Volumn 145, Issue 1-2, 2014, Pages 163-177

Dijkstra's algorithm and L-concave function maximization

(2) Murota, Kazuo a Shioura, Akiyoshi b

a UNIVERSITY OF TOKYO (Japan)

b TOHOKU UNIVERSITY (Japan)

Author keywords

Dijkstra's algorithm; Discrete concave function; Shortest path problem; Steepest ascent algorithm

Indexed keywords

GRAPH THEORY; LINEAR PROGRAMMING; MOLECULAR PHYSICS;

ASCENT ALGORITHMS; AUXILIARY VARIABLES; CONCAVE FUNCTION; DIJKSTRA'S ALGORITHMS; DISCRETE CONVEX ANALYSIS; NONNEGATIVE EDGE LENGTHS; SHORTEST PATH PROBLEM; SINGLE-SOURCE SHORTEST PATHS;

ALGORITHMS;

EID: 84901855875 PISSN: 00255610 EISSN: 14364646 Source Type: Journal
DOI: 10.1007/s10107-013-0643-2 Document Type: Article

Times cited : (30)

References (16)

1
- 0003515463
- Prentice Hall Upper Side River 1201.90001
- Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Side River (1993)
- (1993) Network Flows: Theory, Algorithms, and Applications
- Ahuja, R.K.¹ Magnanti, T.L.² Orlin, J.B.³

2
- 0343872309
- A dual algorithm for submodular flow problems
- 10.1016/0167-6377(91)90027-M 0754.90023 1141345
- Chung, N-k, Tcha, D-w: A dual algorithm for submodular flow problems. Oper. Res. Lett. 10, 489-495 (1991)
- (1991) Oper. Res. Lett. , vol.10 , pp. 489-495
- Chung, N.-K.¹ Tcha, D.-W.²

3
- 34147120474
- A note on two problems in connexion with graphs
- 10.1007/BF01386390 0092.16002 107609
- Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269-271 (1959)
- (1959) Numer. Math. , vol.1 , pp. 269-271
- Dijkstra, E.W.¹

4
- 0001034606
- A min-max relation for submodular functions on graphs
- 10.1016/S0167-5060(08)70734-9 460169
- Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185-204 (1977)
- (1977) Ann. Discrete Math. , vol.1 , pp. 185-204
- Edmonds, J.¹ Giles, R.²

5
- 0004289518
- 2 Elsevier Amsterdam 1119.90044
- Fujishige, F.: Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam (2005)
- (2005) Submodular Functions and Optimization
- Fujishige, F.¹

6
- 0020708796
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
- 10.1007/BF02591772 0501.90035 686880
- Hassin, R.: The minimum cost flow problem: a unifying approach to dual algorithms and a new tree-search algorithm. Math. Program. 25, 228-239 (1983)
- (1983) Math. Program. , vol.25 , pp. 228-239
- Hassin, R.¹

7
- 0000335630
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- 10.1145/502090.502096 1127.90402 2144929
- Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. J. ACM 48, 761-777 (2001)
- (2001) J. ACM , vol.48 , pp. 761-777
- Iwata, S.¹ Fleischer, L.² Fujishige, S.³

8
- 0345848882
- On some communication network problems
- Bellman, R., Hall, M. Jr (eds.) American Mathematical Society, Providence
- Kalaba, R.: On some communication network problems. In: Bellman, R., Hall, M. Jr (eds.) Proceedings of Symposia in Applied Mathematics, vol. 10, pp. 261-280. American Mathematical Society, Providence (1960)
- (1960) Proceedings of Symposia in Applied Mathematics , vol.10 , pp. 261-280
- Kalaba, R.¹

9
- 68449099927
- New algorithms for convex cost tension problem with application to computer vision
- 10.1016/j.disopt.2009.04.006 1179.90320 2561405
- Kolmogorov, V., Shioura, A.: New algorithms for convex cost tension problem with application to computer vision. Discrete Optim. 6, 378-393 (2009)
- (2009) Discrete Optim. , vol.6 , pp. 378-393
- Kolmogorov, V.¹ Shioura, A.²

10
- 0002196472
- Discrete convex analysis
- 0920.90103 1650321
- Murota, K.: Discrete convex analysis. Math. Program. 83, 313-371 (1998)
- (1998) Math. Program. , vol.83 , pp. 313-371
- Murota, K.¹

11
- 0034156590
- Algorithms in discrete convex analysis
- Murota, K.: Algorithms in discrete convex analysis. IEICE Trans. Syst. Inf. E83-D, 344-352 (2000)
- (2000) IEICE Trans. Syst. Inf. , pp. 344-352
- Murota, K.¹

12
- 0010816785
- SIAM Philadelphia 10.1137/1.9780898718508 1029.90055
- Murota, K.: Discrete Convex Analysis. SIAM, Philadelphia (2003)
- (2003) Discrete Convex Analysis
- Murota, K.¹

13
- 4043168508
- On steepest descent algorithms for discrete convex functions
- 10.1137/S1052623402419005 1071.90027 2085937
- Murota, K.: On steepest descent algorithms for discrete convex functions. SIAM J. Optim. 14, 699-707 (2003)
- (2003) SIAM J. Optim. , vol.14 , pp. 699-707
- Murota, K.¹

14
- 0013533304
- Extension of M-convexity and L-convexity to polyhedral convex functions
- 10.1006/aama.2000.0702 1073.90544 1788825
- Murota, K., Shioura, A.: Extension of M-convexity and L-convexity to polyhedral convex functions. Adv. Appl. Math. 25, 352-427 (2000)
- (2000) Adv. Appl. Math. , vol.25 , pp. 352-427
- Murota, K.¹ Shioura, A.²

15
- 0034311821
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time
- 10.1006/jctb.2000.1989 1052.90067 1794698
- Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory Ser. B 80, 346-355 (2000)
- (2000) J. Comb. Theory Ser. B , vol.80 , pp. 346-355
- Schrijver, A.¹

16
- 0013169095
- Springer Berlin
- Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)
- (2003) Combinatorial Optimization: Polyhedra and Efficiency
- Schrijver, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.