메뉴 건너뛰기




Volumn 92, Issue 2-3, 1999, Pages 211-215

Minimizing a submodular function arising from a concave function

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0041596835     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00051-7     Document Type: Article
Times cited : (11)

References (8)
  • 2
    • 0039687324 scopus 로고
    • Lexicographically optimal base of a polymatroid with respect to a weight vector
    • S. Fujishige, Lexicographically optimal base of a polymatroid with respect to a weight vector, Math. Oper. Res. 5 (1980) 186-196.
    • (1980) Math. Oper. Res. , vol.5 , pp. 186-196
    • Fujishige, S.1
  • 4
    • 0024610615 scopus 로고
    • A fast parametric maximum flow algorithm and applications
    • G. Gallo, M.D. Grigoriadis, R.E. Tarjan, A fast parametric maximum flow algorithm and applications, SIAM J. Comput. 18 (1989) 30-55.
    • (1989) SIAM J. Comput. , vol.18 , pp. 30-55
    • Gallo, G.1    Grigoriadis, M.D.2    Tarjan, R.E.3
  • 5
    • 84966244008 scopus 로고
    • Majorization on a partially ordered set
    • F.K. Hwang, Majorization on a partially ordered set, Proc. Amer. Math. Soc. 76 (1979) 199-204.
    • (1979) Proc. Amer. Math. Soc. , vol.76 , pp. 199-204
    • Hwang, F.K.1
  • 6
    • 0008694731 scopus 로고    scopus 로고
    • A capacity scaling algorithm for convex cost submodular flows
    • S. Iwata, A capacity scaling algorithm for convex cost submodular flows, Math. Programming 76 (1997) 299-308.
    • (1997) Math. Programming , vol.76 , pp. 299-308
    • Iwata, S.1
  • 7
    • 0016972463 scopus 로고
    • Maximal closure of a graph and applications to combinatorial problems
    • J.-C. Picard, Maximal closure of a graph and applications to combinatorial problems, Management Sci. 22 (1976) 1268-1272.
    • (1976) Management Sci. , vol.22 , pp. 1268-1272
    • Picard, J.-C.1
  • 8
    • 0020208962 scopus 로고
    • Selected applications on minimum cuts in networks
    • J.-C. Picard, M. Queyranne, Selected applications on minimum cuts in networks, INFOR 20 (1982) 394-422.
    • (1982) INFOR , vol.20 , pp. 394-422
    • Picard, J.-C.1    Queyranne, M.2


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