메뉴 건너뛰기
Mathematics of Operations Research
Volumn 22, Issue 2, 1997, Pages 257-265
Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time
Author keywords

Bipartition inequalities; Clique trees; Combs; Cutting planes; Separation; Traveling salesman problem
Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);
EID: 0031142588     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.22.2.257     Document Type: Article
Times cited : (19)
References (12)
  • 1
    • 0000639521 scopus 로고
    • Small traveling salesman polytopes
    • Boyd, S. C., W. H. Cunningham (1991). Small traveling salesman polytopes. Math. Oper. Res. 16 259-271.
    • (1991) Math. Oper. Res. , vol.16 , pp. 259-271
    • Boyd, S.C.1    Cunningham, W.H.2
  • 2
    • 0001214263 scopus 로고
    • Maximum matching and a polyhedron with O, 1-vertices
    • Edmonds, J. (1965). Maximum matching and a polyhedron with O, 1-vertices, J. Res. Nat. Bur. Standards, Section B 69 125-130.
    • (1965) J. Res. Nat. Bur. Standards, Section B , vol.69 , pp. 125-130
    • Edmonds, J.1
  • 3
    • 0022809003 scopus 로고
    • Clique tree inequalities and the symmetric traveling salesman problem
    • Grötschel, M., W. R. Pulleyblank (1986). Clique tree inequalities and the symmetric traveling salesman problem. Math. Oper. Res. 11 537-569.
    • (1986) Math. Oper. Res. , vol.11 , pp. 537-569
    • Grötschel, M.1    Pulleyblank, W.R.2
  • 6
    • 0000803599 scopus 로고
    • The binested inequalities for the symmetric traveling salesman polytope
    • Naddef, D. (1992). The binested inequalities for the symmetric traveling salesman polytope. Math. Oper. Res. 17 882-900.
    • (1992) Math. Oper. Res. , vol.17 , pp. 882-900
    • Naddef, D.1
  • 7
    • 84948969732 scopus 로고
    • Computing all small cuts in undirected networks
    • Algorithms and computation, Beijing, Springer, Berlin, 1994
    • Nagamochi, H., N. Kazuhiro, T. Ibaraki (1994a). Computing all small cuts in undirected networks, Algorithms and computation, Beijing, Lecture Notes in Comp. Sci. 834, Springer, Berlin, 1994, 190-198.
    • (1994) Lecture Notes in Comp. Sci. , vol.834 , pp. 190-198
    • Nagamochi, H.1    Kazuhiro, N.2    Ibaraki, T.3
  • 8
    • 0028699063 scopus 로고
    • Implementing an efficient minimum capacity cut algorithm
    • _, K. Nishimura, T. Ibaraki (1994b). Implementing an efficient minimum capacity cut algorithm. Math. Programming 67 325-341.
    • (1994) Math. Programming , vol.67 , pp. 325-341
    • Nishimura, K.1    Ibaraki, T.2
  • 9
    • 0020092747 scopus 로고
    • Odd minimum cut sets and b-matchings
    • Padberg, M. W., M. R. Rao (1982). Odd minimum cut sets and b-matchings, Math. Oper. Res. 7 67-80.
    • (1982) Math. Oper. Res. , vol.7 , pp. 67-80
    • Padberg, M.W.1    Rao, M.R.2
  • 10
    • 0010690078 scopus 로고
    • A branch-and-cut approach to a traveling salesman problem with side constraints
    • _, G. Rinaldi (1989). A branch-and-cut approach to a traveling salesman problem with side constraints. Management Sci. 35 1393-1412.
    • (1989) Management Sci. , vol.35 , pp. 1393-1412
    • Rinaldi, G.1
  • 11
    • 0025448140 scopus 로고
    • Facet identification for the symmetric traveling salesman polytope
    • _, _ (1990a). Facet identification for the symmetric traveling salesman polytope, Math. Programming 47 219-257.
    • (1990) Math. Programming , vol.47 , pp. 219-257
  • 12
    • 0003036173 scopus 로고
    • An efficient algorithm for the minimum capacity cut problem
    • _, _ (1990b). An efficient algorithm for the minimum capacity cut problem. Math. Programming 47 19-36,
    • (1990) Math. Programming , vol.47 , pp. 19-36

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