메뉴 건너뛰기




Volumn 39, Issue 3, 2004, Pages 189-208

A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem

Author keywords

Convex integer programming; Minimum cut; Network flow; Nonlinear integer programming; Total unimodularity

Indexed keywords

COSTS; FUNCTIONS; INTEGER PROGRAMMING; NONLINEAR SYSTEMS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; STATISTICAL METHODS;

EID: 21044452195     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1085-2     Document Type: Article
Times cited : (31)

References (21)
  • 1
    • 0042266794 scopus 로고    scopus 로고
    • Solving the convex cost integer dual network flow problem
    • [AHO]
    • [AHO] R. K. Ahuja, D. S. Hochbaum, and J. B. Orlin. Solving the convex cost integer dual network flow problem. Management Science, 49(7), 950-964, 2003.
    • (2003) Management Science , vol.49 , Issue.7 , pp. 950-964
    • Ahuja, R.K.1    Hochbaum, D.S.2    Orlin, J.B.3
  • 4
    • 0026812716 scopus 로고
    • On the computational behavior of a polynomial time network flow algorithm
    • [BJ]
    • [BJ] R. G. Bland and D. L. Jensen. On the computational behavior of a polynomial time network flow algorithm. Mathematical Programming, 54, 1-39.1992.
    • (1992) Mathematical Programming , vol.54 , pp. 1-39
    • Bland, R.G.1    Jensen, D.L.2
  • 5
    • 0029287734 scopus 로고
    • A randomized maximum-flow algorithm
    • [CH]
    • [CH] J. Cheriyan and T. Hagerup. A randomized maximum-flow algorithm. SIAM Journal on Computing, 24, 203-226, 1995.
    • (1995) SIAM Journal on Computing , vol.24 , pp. 203-226
    • Cheriyan, J.1    Hagerup, T.2
  • 7
    • 0032157143 scopus 로고    scopus 로고
    • Beyond the flow decomposition barrier
    • [GR]
    • [GR] A. V. Goldberg and S. Rao. Beyond the flow decomposition barrier. Journal of the ACM, 45, 783-797, 1998.
    • (1998) Journal of the ACM , vol.45 , pp. 783-797
    • Goldberg, A.V.1    Rao, S.2
  • 8
    • 0024090156 scopus 로고
    • A new approach to the maximum flow problem
    • [GT1]
    • [GT1] A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35, 921-940, 1988.
    • (1988) Journal of the ACM , vol.35 , pp. 921-940
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 9
    • 0001764412 scopus 로고
    • Solving minimum cost flow problem by successive approximation
    • [GT2]
    • [GT2] A. V. Goldberg and R. E. Tarjan. Solving minimum cost flow problem by successive approximation. Mathematics of Operations Research, 15, 430-466, 1990.
    • (1990) Mathematics of Operations Research , vol.15 , pp. 430-466
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 11
    • 0008821575 scopus 로고    scopus 로고
    • An efficient algorithm for image segmentation, Markov Random Fields and related problems
    • [H2]
    • [H2] D. S. Hochbaum. An efficient algorithm for image segmentation, Markov Random Fields and related problems. Journal of the ACM, 48(4), 686-701, 2001.
    • (2001) Journal of the ACM , vol.48 , Issue.4 , pp. 686-701
    • Hochbaum, D.S.1
  • 12
    • 26444498720 scopus 로고    scopus 로고
    • [H3] Manuscript, University of California, Berkeley, CA, July
    • [H3] D.S. Hochbaum. The inverse shortest paths problem. Manuscript, University of California, Berkeley, CA, July 2001.
    • (2001) The Inverse Shortest Paths Problem
    • Hochbaum, D.S.1
  • 13
    • 0037118770 scopus 로고    scopus 로고
    • Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
    • [H4]
    • [H4] D. S. Hochbaum. Solving integer programs over monotone inequalities in three variables: a framework for half integrality and good approximations. European Journal of Operational Research, 140(2), 291-321, 2002.
    • (2002) European Journal of Operational Research , vol.140 , Issue.2 , pp. 291-321
    • Hochbaum, D.S.1
  • 14
    • 3142618986 scopus 로고    scopus 로고
    • Efficient algorithms for the inverse spanning tree problem
    • [H5]
    • [H5] D. S. Hochbaum. Efficient algorithms for the inverse spanning tree problem. Operations Research, 51(5), 785-797, 2003.
    • (2003) Operations Research , vol.51 , Issue.5 , pp. 785-797
    • Hochbaum, D.S.1
  • 15
    • 0002555219 scopus 로고
    • Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
    • [HMNT]
    • [HMNT] D. S. Hochbaum, N. Megiddo, J. Naor, and A. Tamir. Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Mathematical Programming, 62, 69-83, 1993.
    • (1993) Mathematical Programming , vol.62 , pp. 69-83
    • Hochbaum, D.S.1    Megiddo, N.2    Naor, J.3    Tamir, A.4
  • 16
    • 0028730912 scopus 로고
    • Simple and fast algorithms for linear and integer programs with two variables per inequality
    • [HN]
    • [HN] D. S. Hochbaum and J. Naor. Simple and fast algorithms for linear and integer programs with two variables per inequality. SIAM Journal on Computing, 23(6), 1179-1192,1994.
    • (1994) SIAM Journal on Computing , vol.23 , Issue.6 , pp. 1179-1192
    • Hochbaum, D.S.1    Naor, J.2
  • 18
    • 0025496223 scopus 로고
    • Convex separable optimization is not much harder than linear optimization
    • [HS]
    • [HS] D. S. Hochbaum and J. G. Shanthikumar. Convex separable optimization is not much harder than linear optimization. Journal of the ACM, 37, 843-862, 1990.
    • (1990) Journal of the ACM , vol.37 , pp. 843-862
    • Hochbaum, D.S.1    Shanthikumar, J.G.2
  • 19
    • 0031209772 scopus 로고    scopus 로고
    • Polynomial methods for separable convex optimization in unimodular linear spaces with applications
    • [KM]
    • [KM] A. V. Karzanov and S. T. McCormick. Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM Journal on Computing, 26(4), 1245-1275, 1997.
    • (1997) SIAM Journal on Computing , vol.26 , Issue.4 , pp. 1245-1275
    • Karzanov, A.V.1    McCormick, S.T.2
  • 20
    • 0016972463 scopus 로고
    • Maximal closure of a graph and applications to combinatorial problems
    • [P]
    • [P] J. C. Picard. Maximal closure of a graph and applications to combinatorial problems. Management Science, 22, 1268-1272, 1976.
    • (1976) Management Science , vol.22 , pp. 1268-1272
    • Picard, J.C.1
  • 21
    • 0002025797 scopus 로고
    • Scaling techniques for minimum cost network flows
    • [R] V. Pape, ed. Carl Hansen, Munich
    • [R] H. Röck. Scaling techniques for minimum cost network flows. In Discrete Structures and Algorithms, V. Pape, ed. Carl Hansen, Munich, pp. 181-191, 1980.
    • (1980) Discrete Structures and Algorithms , pp. 181-191
    • Röck, H.1


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