메뉴 건너뛰기




Volumn 106, Issue 3, 2006, Pages 567-586

A convex-analysis perspective on disjunctive cuts

Author keywords

Convex analysis; Cutting planes; Disjunctive cut; Integer programming; Lift and project; Separation

Indexed keywords

CONVEX ANALYSIS; CUTTING PLANES; DISJUNCTIVE CUTS; LIFT AND PROJECT;

EID: 33644524073     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0670-8     Document Type: Article
Times cited : (22)

References (12)
  • 1
    • 77957040455 scopus 로고
    • Disjunctive programming
    • Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3-51 (1979)
    • (1979) Ann. Discrete Math. , vol.5 , pp. 3-51
    • Balas, E.1
  • 2
    • 0000185277 scopus 로고
    • A lift-and-project cutting plane algorithm for mixed 0-1 programs
    • Balas, E., Cornuéjols, G., Ceria, S.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Prog. 58, 295-324 (1993)
    • (1993) Math. Prog. , vol.58 , pp. 295-324
    • Balas, E.1    Cornuéjols, G.2    Ceria, S.3
  • 3
    • 84867946795 scopus 로고    scopus 로고
    • Lift-and-project for mixed 0-1 programming: Recent progress
    • Balas, E., Perregaard, M.: Lift-and-project for mixed 0-1 programming: recent progress. Discrete Appl. Math. 123, 129-154 (2002)
    • (2002) Discrete Appl. Math. , vol.123 , pp. 129-154
    • Balas, E.1    Perregaard, M.2
  • 5
    • 33644506015 scopus 로고    scopus 로고
    • Personal communication
    • Bonami, P.: Personal communication, 2004
    • (2004)
    • Bonami, P.1
  • 6
    • 0141669222 scopus 로고    scopus 로고
    • Disjunctive cuts for mixed 0-1 programming: Duality and lifting
    • GSB, Columbia Univ.
    • Ceria, S., Soares, J.: Disjunctive cuts for mixed 0-1 programming: duality and lifting. Technical report, GSB, Columbia Univ., 1997
    • (1997) Technical Report
    • Ceria, S.1    Soares, J.2
  • 7
    • 0007861073 scopus 로고    scopus 로고
    • Convex programming for disjunctive convex optimization
    • Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Prog. 86 (3), 595-614 (1999)
    • (1999) Math. Prog. , vol.86 , Issue.3 , pp. 595-614
    • Ceria, S.1    Soares, J.2
  • 8
    • 34249954960 scopus 로고
    • Chvátal closures for mixed integer programs
    • Cook, W., Kannan, R., Schrijver, A.: Chvátal closures for mixed integer programs. Math. Prog. 47, 155-174 (1990)
    • (1990) Math. Prog. , vol.47 , pp. 155-174
    • Cook, W.1    Kannan, R.2    Schrijver, A.3
  • 9
    • 0004119489 scopus 로고
    • An algorithm for the mixed integer problem
    • The Rand Coporation
    • Gomory, R.: An algorithm for the mixed integer problem. Technical Report RM-2597, The Rand Coporation, 1960
    • (1960) Technical Report , vol.RM-2597
    • Gomory, R.1


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