SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 113, Issue 2-3, 2001, Pages 183-194

A strongly polynomial time algorithm for a constrained submodular optimization problem

(1) Hartvigsen, David a

a UNIVERSITY OF NOTRE DAME (United States)

Author keywords

Base polyhedron; Max flow; Min cost spanning tree; Submodular function

Indexed keywords

EID: 0035887946 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(00)00285-7 Document Type: Article

Times cited : (1)

References (17)

1
- 0018442681
- The sharing problem
- Brown J.R. The sharing problem. Oper. Res. 27:1979;324-340.
- (1979) Oper. Res. , vol.27 , pp. 324-340
- Brown, J.R.¹

2
- 51249177040
- On submodular function minimization
- Cunningham W.H. On submodular function minimization. Combinatorica. 5(3):1985;185-192.
- (1985) Combinatorica , vol.5 , Issue.3 , pp. 185-192
- Cunningham, W.H.¹

3
- 0000891810
- Algorithm for a solution of a problem of maximum flow in a network with power estimation
- Dinic E.A. Algorithm for a solution of a problem of maximum flow in a network with power estimation. Sov. Math. Dokl. 2:1970;1277-1280.
- (1970) Sov. Math. Dokl. , vol.2 , pp. 1277-1280
- Dinic, E.A.¹

4
- 0002167079
- Submodular functions, matroids, and certain polyhedra
- R.K. Guy, H. Hanoni, N. Sauer, & J. Schonheim. New York: Gordon and Breach
- Edmonds J. Submodular functions, matroids, and certain polyhedra. Guy R.K., Hanoni H., Sauer N., Schonheim J. Combinatorial Structures and their Applications. 1970;69-87 Gordon and Breach, New York.
- (1970) Combinatorial Structures and Their Applications , pp. 69-87
- Edmonds, J.¹

5
- 0015330635
- Theoretical improvements in algorithmic efficiency for network flow problems
- Edmonds J., Karp R.M. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM. 19:1972;248-264.
- (1972) J. ACM , vol.19 , pp. 248-264
- Edmonds, J.¹ Karp, R.M.²

6
- 0001261128
- Maximal flow through a network
- Ford L.R., Fulkerson D.R. Maximal flow through a network. Canad. J. Math. 8:1956;399-404.
- (1956) Canad. J. Math. , vol.8 , pp. 399-404
- Ford, L.R.¹ Fulkerson, D.R.²

7
- 0020872614
- Submodular systems and related topics
- Fujishige S. Submodular systems and related topics. Math. Programming Study. 22:1984;113-131.
- (1984) Math. Programming Study , vol.22 , pp. 113-131
- Fujishige, S.¹

8
- 0004289518
- Amsterdam: North Holland
- Fujishige S. Submodular Functions and Optimization. 1991;North Holland, Amsterdam.
- (1991) Submodular Functions and Optimization
- Fujishige, S.¹

9
- 0342541293
- Towards equitable distribution via proportional equity constraints
- Hall N.G., Vohra R.V. Towards equitable distribution via proportional equity constraints. Math. Programming. 58:1993;287-294.
- (1993) Math. Programming , vol.58 , pp. 287-294
- Hall, N.G.¹ Vohra, R.V.²

10
- 0032131573
- A submodular optimization problem with side constraints
- Hartvigsen D. A submodular optimization problem with side constraints. Math. Oper. Res. 23(3):1998;661-679.
- (1998) Math. Oper. Res. , vol.23 , Issue.3 , pp. 661-679
- Hartvigsen, D.¹

11
- 0347496172
- Gröbner bases in integer programming
- Hosten H., Thomas R.R. Gröbner bases in integer programming. Optima. 48:1995;1, 3-5.
- (1995) Optima , vol.48 , pp. 1
- Hosten, H.¹ Thomas, R.R.²

12
- 0020167731
- Optimal sharing
- Ichimori T., Ishii H., Nishida T. Optimal sharing. Math. Programming. 23:1982;341-348.
- (1982) Math. Programming , vol.23 , pp. 341-348
- Ichimori, T.¹ Ishii, H.² Nishida, T.³

13
- 0002504695
- Working paper
- W. Iwata, L. Fleischer, S. Fujishige A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions, Working paper, 1999.
- (1999) A Combinatorial, Strongly Polynomial-time Algorithm for Minimizing Submodular Functions
- Iwata, W.¹ Fleischer, L.² Fujishige, S.³

14
- 0002716901
- Submodular functions and convexity
- A. Machem, M. Grotschel, & B. Korte. Berlin: Springer
- Lovasz L. Submodular functions and convexity. Machem A., Grotschel M., Korte B. Mathematical Programming - The State of the Art. 1983;235-257 Springer, Berlin.
- (1983) Mathematical Programming - The State of the Art , pp. 235-257
- Lovasz, L.¹

15
- 0002836025
- Minimizing symmetric submodular functions
- Queyranne M. Minimizing symmetric submodular functions. Math. Programming. 82:1998;3-12.
- (1998) Math. Programming , vol.82 , pp. 3-12
- Queyranne, M.¹

16
- 0012229744
- Working paper
- A. Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, Working paper, 1999.
- (1999) A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
- Schrijver, A.¹

17
- 0022226781
- Duality for balanced submodular flows
- Zimmerman U. Duality for balanced submodular flows. Discrete Appl. Math. 15:1986;365-376.
- (1986) Discrete Appl. Math. , vol.15 , pp. 365-376
- Zimmerman, U.¹

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