메뉴 건너뛰기




Volumn 29, Issue 3, 2012, Pages 519-534

Equivalence of convex minimization problems over base polytopes

Author keywords

Combinatorial optimization; Convex optimization; Submodular function

Indexed keywords

CONVEX FUNCTIONS; CONVEX MINIMIZATION; CONVEX OBJECTIVES; CONVEX OPTIMIZATION PROBLEMS; DECOMPOSITION ALGORITHM; OPTIMAL SOLUTIONS; POLYMATROIDS; POLYTOPES; SUBMODULAR; SUBMODULAR FUNCTIONS; SUFFICIENT CONDITIONS; USEFUL PROPERTIES;

EID: 84870880936     PISSN: 09167005     EISSN: 1868937X     Source Type: Journal    
DOI: 10.1007/s13160-012-0083-z     Document Type: Article
Times cited : (18)

References (29)
  • 1
    • 84969134693 scopus 로고    scopus 로고
    • Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization
    • Chudak, F.A., Nagano, K.: Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 79-88 (2007)
    • (2007) Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 79-88
    • Chudak, F.A.1    Nagano, K.2
  • 2
    • 0000400051 scopus 로고
    • The egalitarian solution and reduced game properties in convex games
    • Dutta, B.: The egalitarian solution and reduced game properties in convex games. Int. J. Game Theory 19, 153-169 (1990)
    • (1990) Int. J. Game Theory , vol.19 , pp. 153-169
    • Dutta, B.1
  • 3
    • 0000310904 scopus 로고
    • A Concept of egalitarianism under participation constraints
    • Dutta, B., Ray, D.: A Concept of egalitarianism under participation constraints. Econometrica 57, 615-635 (1989)
    • (1989) Econometrica , vol.57 , pp. 615-635
    • Dutta, B.1    Ray, D.2
  • 4
    • 0002167079 scopus 로고
    • Submodular functions, matroids, and certain polyhedra
    • Guy, R., Hanai, H., Sauer, N., Schönheim, J. (eds.), New York
    • Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Guy, R., Hanai, H., Sauer, N., Schönheim, J. (eds.) Combinatorial Structures and Their Applications. Gordon and Breach, New York, pp. 69-87 (1970)
    • (1970) Combinatorial Structures and Their Applications. Gordon and Breach , pp. 69-87
    • Edmonds, J.1
  • 5
    • 0041828774 scopus 로고    scopus 로고
    • A push-relabel framework for submodular function minimization and applications to parametric optimization
    • Fleischer, L., Iwata, S.: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl. Math. 131, 311-322 (2003)
    • (2003) Discrete Appl. Math. , vol.131 , pp. 311-322
    • Fleischer, L.1    Iwata, S.2
  • 6
    • 0039687324 scopus 로고
    • Lexicographically optimal base of a polymatroid with respect to a weight vector
    • Fujishige, S.: Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5, 186-196 (1980)
    • (1980) Math. Oper. Res. , vol.5 , pp. 186-196
    • Fujishige, S.1
  • 7
    • 0020872614 scopus 로고
    • Submodular systems and related topics
    • Fujishige, S.: Submodular systems and related topics. Math. Program. Study 22, 113-131 (1984)
    • (1984) Math. Program. Study , vol.22 , pp. 113-131
    • Fujishige, S.1
  • 9
  • 10
    • 0024610615 scopus 로고
    • A fast parametric maximum flow algorithm and applications
    • Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 30-55 (1989)
    • (1989) SIAM J. Comput. , vol.18 , pp. 30-55
    • Gallo, G.1    Grigoriadis, M.D.2    Tarjan, R.E.3
  • 11
    • 0026221935 scopus 로고
    • Two algorithms for maximizing a separable concave function over a polymatroid feasible region
    • DOI 10.1016/0377-2217(91)90300-K
    • Groenevelt, H.: Two algorithms for maximizing a separable concave function over a polymatroid feasible region. Eur. J. Oper. Res. 54, 227-236 (1991) (Pubitemid 21729720)
    • (1991) European Journal of Operational Research , vol.54 , Issue.2 , pp. 227-236
    • Groenevelt, H.1
  • 13
    • 0000860218 scopus 로고
    • Lower and upper bounds for the allocation problem and other nonlinear optimization problems
    • Hochbaum, D.S.: Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math. Oper. Res. 19, 390-409 (1994)
    • (1994) Math. Oper. Res. , vol.19 , pp. 390-409
    • Hochbaum, D.S.1
  • 14
    • 34547428890 scopus 로고    scopus 로고
    • Submodular function minimization
    • DOI 10.1007/s10107-006-0084-2
    • Iwata, S.: Submodular function minimization. Math. Program. 112, 45-64 (2008) (Pubitemid 47167324)
    • (2008) Mathematical Programming , vol.112 , Issue.1 , pp. 45-64
    • Iwata, S.1
  • 15
    • 0000335630 scopus 로고    scopus 로고
    • A combinatorial strongly polynomial algorithm for minimizing submodular functions
    • Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48, 761-777 (2001)
    • (2001) J. ACM , vol.48 , pp. 761-777
    • Iwata, S.1    Fleischer, L.2    Fujishige, S.3
  • 17
    • 35448998849 scopus 로고    scopus 로고
    • Eisenberg-Gale markets: Algorithms and structural properties
    • DOI 10.1145/1250790.1250845, STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing
    • Jain, K., Vazirani, V.V.: Eisenberg-Gale markets: algorithms and structural properties. In: Proceedings of the 39th ACM Symposium on Theory of Computing, pp. 364-373 (2007) (Pubitemid 47630755)
    • (2007) Proceedings of the Annual ACM Symposium on Theory of Computing , pp. 364-373
    • Jain, K.1    Vazirani, V.V.2
  • 18
    • 0002716901 scopus 로고
    • Submodular functions and convexity
    • Bachem, A., Grötschel, M., Korte, B. (eds.). Springer, Berlin
    • Lovász, L.: Submodular functions and convexity. In: Bachem, A., Grötschel, M., Korte, B. (eds.) Mathematical Programming-The State of the Art, pp. 235-257. Springer, Berlin (1983)
    • (1983) Mathematical Programming-The State of the Art , pp. 235-257
    • Lovász, L.1
  • 20
    • 52949135806 scopus 로고    scopus 로고
    • Submodular function minimization
    • Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.), Chapter 7. Elsevier, Amsterdam
    • McCormick, S.T.: Submodular function minimization. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Discrete Optimization (Handbooks in Operations Research and Management Science, vol. 12), Chapter 7, pp. 321-391. Elsevier, Amsterdam (2005)
    • (2005) Discrete Optimization (Handbooks in Operations Research and Management Science) , vol.12 , pp. 321-391
    • McCormick, S.T.1
  • 21
    • 0003104050 scopus 로고
    • Optimal flows in networks with multiple sources and sinks
    • Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7, 97-107 (1974)
    • (1974) Math. Program. , vol.7 , pp. 97-107
    • Megiddo, N.1
  • 22
    • 38049084528 scopus 로고
    • Note on the universal bases of a pair of polymatroids
    • Murota, K.: Note on the universal bases of a pair of polymatroids. J. Oper. Res. Soc. Jpn. 31, 565-573 (1988)
    • (1988) J. Oper. Res. Soc. Jpn. , vol.31 , pp. 565-573
    • Murota, K.1
  • 23
    • 36448961230 scopus 로고    scopus 로고
    • A strongly polynomial algorithm for line search in submodular polyhedra
    • DOI 10.1016/j.disopt.2007.09.002, PII S1572528607000552
    • Nagano, K.: A strongly polynomial algorithm for line search in submodular polyhedra. Discrete Optim. 4, 349-359 (2007) (Pubitemid 350167033)
    • (2007) Discrete Optimization , vol.4 , Issue.3-4 , pp. 349-359
    • Nagano, K.1
  • 24
    • 67649917781 scopus 로고    scopus 로고
    • A faster parametric submodular function minimization algorithm and applications
    • University of Tokyo
    • Nagano, K.: A faster parametric submodular function minimization algorithm and applications. Technical Report METR 2007-43, University of Tokyo (2007)
    • (2007) Technical Report METR 2007-43
    • Nagano, K.1
  • 25
    • 58149485960 scopus 로고    scopus 로고
    • A faster strongly polynomial time algorithm for submodular function minimization
    • Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118, 237-251 (2009)
    • (2009) Math. Program. , vol.118 , pp. 237-251
    • Orlin, J.B.1
  • 26
    • 0034311821 scopus 로고    scopus 로고
    • A combinatorial algorithm minimizing submodular functions in strongly polynomial time
    • Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory (B) 80, 346-355 (2000)
    • (2000) J. Comb. Theory (B) , vol.80 , pp. 346-355
    • Schrijver, A.1
  • 29
    • 34250385434 scopus 로고
    • Finding the nearest point in A polytope
    • Wolfe, P.: Finding the nearest point in A polytope. Math. Program. 11, 128-149 (1976)
    • (1976) Math. Program. , vol.11 , pp. 128-149
    • Wolfe, P.1


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