메뉴 건너뛰기
Mathematical Programming, Series B
Volumn 89, Issue 3, 2001, Pages 437-448
A disjunctive cutting plane procedure for general mixed-integer linear programs
Author keywords

Mixed integer programming
Indexed keywords

EID: 0011653040     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011407     Document Type: Article
Times cited : (30)
References (10)
  • 1
    • 29044436097 scopus 로고
    • Explicit convex hull representations of discrete sets
    • New Orleans, LA, USA
    • Adams, W.P., Sherali, H.D. (1995): Explicit convex hull representations of discrete sets. Talk at Fall INFORMS meeting, New Orleans, LA, USA
    • (1995) Talk at Fall INFORMS Meeting
    • Adams, W.P.1    Sherali, H.D.2
  • 2
    • 77957040455 scopus 로고
    • Disjunctive programming
    • Hammer, ed., Discrete Optimization, Part II.
    • Balas, E. (1979): Disjunctive programming. In: Hammer, ed., Discrete Optimization, Part II. Ann. Discrete Math. 5, 3-51
    • (1979) Ann. Discrete Math. , vol.5 , pp. 3-51
    • Balas, E.1
  • 3
    • 0000185277 scopus 로고
    • A lift-and-project cutting plane algorithm for mixed 0-1 programs
    • Balas, E., Ceria, S., Cornuéjols, G. (1993): A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-324
    • (1993) Math. Program. , vol.58 , pp. 295-324
    • Balas, E.1    Ceria, S.2    Cornuéjols, G.3
  • 4
    • 0037870067 scopus 로고    scopus 로고
    • Mixed 0-1 programming by lift-and-project in a branch-and-cut framework
    • Balas, E., Ceria, S., Cornuéjols, G. (1996): Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Manage. Sci. 42, 1229-1246
    • (1996) Manage. Sci. , vol.42 , pp. 1229-1246
    • Balas, E.1    Ceria, S.2    Cornuéjols, G.3
  • 5
    • 0042955050 scopus 로고
    • Unpublished paper. Carnegie-Mellon University, Graduate School of Industrial Administration, Pittsburgh, PA 15213, February 1994
    • Balas, E., Ceria, S., Cornuéjols, G., Pataki, G. (1994): Polyhedral methods for the maximum clique problem. Unpublished paper. Carnegie-Mellon University, Graduate School of Industrial Administration, Pittsburgh, PA 15213, February 1994
    • (1994) Polyhedral Methods for the Maximum Clique Problem
    • Balas, E.1    Ceria, S.2    Cornuéjols, G.3    Pataki, G.4
  • 7
    • 0001154274 scopus 로고
    • Cones of matrices and set-functions and 0-1 optimization
    • Lovász, L., Schrijver, A. (1991): Cones of matrices and set-functions and 0-1 optimization SIAM J. Optim. 1, 166-190
    • (1991) SIAM J. Optim. , vol.1 , pp. 166-190
    • Lovász, L.1    Schrijver, A.2
  • 8
    • 0001321687 scopus 로고
    • A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems
    • Sherali, H.D., Adams, W.P. (1990): A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411-430
    • (1990) SIAM J. Discrete Math. , vol.3 , pp. 411-430
    • Sherali, H.D.1    Adams, W.P.2
  • 9
    • 0002500749 scopus 로고
    • A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems
    • Sherali, H.D., Adams, W.P. (1994): A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52, 83-106
    • (1994) Discrete Appl. Math. , vol.52 , pp. 83-106
    • Sherali, H.D.1    Adams, W.P.2
  • 10
    • 0001367989 scopus 로고    scopus 로고
    • A branch-and-cut method for 0-1 mixed convex programming
    • Stubbs, R.A., Mehrotra, S. (1999): A branch-and-cut method for 0-1 mixed convex programming Math. Program. A 86, 515-532
    • (1999) Math. Program. A , vol.86 , pp. 515-532
    • Stubbs, R.A.1    Mehrotra, S.2

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