메뉴 건너뛰기




Volumn 74, Issue 3, 1996, Pages 221-235

{0, 1/2}-Chvátal-Gomory cuts

Author keywords

Binary clutters; Cutting planes; Integer programming

Indexed keywords


EID: 0001340651     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592196     Document Type: Article
Times cited : (139)

References (21)
  • 1
    • 0001120835 scopus 로고
    • The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph
    • E. Balas, "The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph," SIAM Journal on Discrete Mathematics 2 (4) (1989) 425-451.
    • (1989) SIAM Journal on Discrete Mathematics , vol.2 , Issue.4 , pp. 425-451
    • Balas, E.1
  • 4
    • 0002658216 scopus 로고
    • The uncapacitated facility location problem
    • P.B. Mirchandani and R.L. Francis, eds., Wiley, New York
    • G. Cornuéjols, G.L. Nemhauser and L.A. Wolsey, "The uncapacitated facility location problem," in: P.B. Mirchandani and R.L. Francis, eds., Discrete Location Theory (Wiley, New York, 1990) pp. 119-171.
    • (1990) Discrete Location Theory , pp. 119-171
    • Cornuéjols, G.1    Nemhauser, G.L.2    Wolsey, L.A.3
  • 7
    • 0003348586 scopus 로고
    • Matching: A well-solved class of integer linear programs
    • R.K. Guy et al., eds., Gordon and Breach, New York
    • J. Edmonds and H.L. Johnson, "Matching: a well-solved class of integer linear programs," in: R.K. Guy et al., eds., Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) pp. 89-92.
    • (1970) Combinatorial Structures and Their Applications , pp. 89-92
    • Edmonds, J.1    Johnson, H.L.2
  • 10
    • 51249175913 scopus 로고
    • Matrices with the Edmonds-Johnson property
    • A.M.H. Gerards and A. Schrijver, "Matrices with the Edmonds-Johnson property," Combinatorica 6 (4) (1986) 365-379.
    • (1986) Combinatorica , vol.6 , Issue.4 , pp. 365-379
    • Gerards, A.M.H.1    Schrijver, A.2
  • 11
    • 0021521702 scopus 로고
    • A cutting plane algorithm for the linear ordering problem
    • M. Grötschel, M. Jünger and G. Reinelt, "A cutting plane algorithm for the linear ordering problem," Operations Research 32 (1984) 1195-1220.
    • (1984) Operations Research , vol.32 , pp. 1195-1220
    • Grötschel, M.1    Jünger, M.2    Reinelt, G.3
  • 14
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • M. Grötschel, L. Lovász and A. Schrijver, "The ellipsoid method and its consequences in combinatorial optimization," Combinatorica 1 (1981) 169-197.
    • (1981) Combinatorica , vol.1 , pp. 169-197
    • Grötschel, M.1    Lovász, L.2    Schrijver, A.3
  • 17
    • 4244147500 scopus 로고
    • On the transitive acyclic subdigraph polytope
    • G. Rinaldi and L.A. Wolsey, eds.
    • R. Müller, "On the transitive acyclic subdigraph polytope," in: G. Rinaldi and L.A. Wolsey, eds., Proceedings of Third IPCO Conference (1993) pp. 463-477.
    • (1993) Proceedings of Third IPCO Conference , pp. 463-477
    • Müller, R.1


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