메뉴 건너뛰기
Mathematical Methods of Operations Research
Volumn 47, Issue 1, 1998, Pages 51-58
Inverse problem of minimum cuts
Author keywords

Inverse problem; Maximum flow; Minimum cost circulation; Minimum cut; Strongly polynomial algorithm
Indexed keywords

EID: 0002186740     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01193836     Document Type: Article
Times cited : (40)
References (14)
  • 1
    • 0026742679 scopus 로고
    • On an instance of the inverse shortest paths problem
    • Burton D, Toint PhL (1992) On an instance of the inverse shortest paths problem. Math. Prog. 53:45-61
    • (1992) Math. Prog. , vol.53 , pp. 45-61
    • Burton, D.1    Toint, Ph.L.2
  • 2
    • 0003088717 scopus 로고
    • An inverse problem of the weighted shortest path problem
    • Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. Japan J. Indust. Appl. Math. 12:47-59
    • (1995) Japan J. Indust. Appl. Math. , vol.12 , pp. 47-59
    • Xu, S.1    Zhang, J.2
  • 3
    • 0000036676 scopus 로고
    • A column generation method for inverse shortest path problems
    • Zhang J, Ma Z, Yang C (1995) A column generation method for inverse shortest path problems. ZOR Math. Methods Oper. Res. 41:347-358
    • (1995) ZOR Math. Methods Oper. Res. , vol.41 , pp. 347-358
    • Zhang, J.1    Ma, Z.2    Yang, C.3
  • 4
    • 0030358139 scopus 로고    scopus 로고
    • On the inverse problem of minimum spanning tree with partition constraints
    • Zhang J, Liu Z, Ma Z (1996) On the inverse problem of minimum spanning tree with partition constraints. ZOR Math. Methods Oper. Res. 44:171-187
    • (1996) ZOR Math. Methods Oper. Res. , vol.44 , pp. 171-187
    • Zhang, J.1    Liu, Z.2    Ma, Z.3
  • 5
    • 0030213429 scopus 로고    scopus 로고
    • Calculating some inverse linear programming problems
    • Zhang J, Liu Z (1996) Calculating some inverse linear programming problems. J. Comp. & Appl. Math 72:261-273
    • (1996) J. Comp. & Appl. Math , vol.72 , pp. 261-273
    • Zhang, J.1    Liu, Z.2
  • 6
    • 0030480159 scopus 로고    scopus 로고
    • A network flow method for solving some inverse combinatorial optimization problems
    • Zhang J, Ma Z (1996) A network flow method for solving some inverse combinatorial optimization problems. Optimization 37:59-72
    • (1996) Optimization , vol.37 , pp. 59-72
    • Zhang, J.1    Ma, Z.2
  • 7
    • 0030644203 scopus 로고    scopus 로고
    • Inverse matroid intersection problem
    • Cai M, Li Y (1997) Inverse matroid intersection problem. ZOR Math. Methods Oper. Res. 45:235-243
    • (1997) ZOR Math. Methods Oper. Res. , vol.45 , pp. 235-243
    • Cai, M.1    Li, Y.2
  • 8
    • 0031462086 scopus 로고    scopus 로고
    • Inverse maximum flow and minimum cut problems
    • Yang C, Zhang J, Ma Z (1997) Inverse maximum flow and minimum cut problems. Optimization 40:147-170
    • (1997) Optimization , vol.40 , pp. 147-170
    • Yang, C.1    Zhang, J.2    Ma, Z.3
  • 9
    • 11644254473 scopus 로고    scopus 로고
    • Inverse minimum cut problems
    • Institute of Systems Science, Academia Sinica, Beijing, China
    • Yang X Inverse minimum cut problems. Working paper, Institute of Systems Science, Academia Sinica, Beijing, China
    • Working Paper
    • Yang, X.1
  • 12
    • 51249170715 scopus 로고
    • A strongly polynomial minimum cost circulation algorithm
    • Tardos E (1985) A strongly polynomial minimum cost circulation algorithm. Combinatorica 5:247-255
    • (1985) Combinatorica , vol.5 , pp. 247-255
    • Tardos, E.1
  • 13
    • 0022672734 scopus 로고
    • A strongly polynomial algorithm to solve combinatorial linear programs
    • Tardos E (1986) A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34:250-256
    • (1986) Operations Research , vol.34 , pp. 250-256
    • Tardos, E.1
  • 14
    • 0001748672 scopus 로고
    • Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
    • Hoffman AJ (1960) Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proc. Symposium on Appl. Math. 10:113-127
    • (1960) Proc. Symposium on Appl. Math. , vol.10 , pp. 113-127
    • Hoffman, A.J.1

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