메뉴 건너뛰기
Operations Research
Volumn 52, Issue 3, 2004, Pages 487-490
Sequence independent lifting for mixed-integer programming
Author keywords

Facets; Integer programming: Theory; Lifting; Superadditive functions
Indexed keywords

INTEGER PROGRAMMING: THEORY, SUPERADDITIVE FUNCTIONS, LIFTING, FACETS; MIXED-INTEGER PROGRAMMING (MIP); SEQUENCE INDEPENDENT LIFTING;
EID: 10844248146     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1030.0099     Document Type: Article
Times cited : (34)
References (13)
  • 1
    • 33751012054 scopus 로고    scopus 로고
    • Sequence independent lifting for mixed-integer programming
    • University of California, Berkeley, CA
    • Atamtürk, A. 2001. Sequence independent lifting for mixed-integer programming. Research report BCOL.01.02. University of California, Berkeley, CA.
    • (2001) Research Report , vol.BCOL.01.02
    • Atamtürk, A.1
  • 2
    • 3042514606 scopus 로고    scopus 로고
    • On the facets of the mixed-integer knapsack polyhedron
    • Atamtürk, A. 2003. On the facets of the mixed-integer knapsack polyhedron. Math. Programming 98 145-175.
    • (2003) Math. Programming , vol.98 , pp. 145-175
    • Atamtürk, A.1
  • 3
    • 77957040455 scopus 로고
    • Disjunctive programming
    • Balas, E. 1979. Disjunctive programming. Ann. Discrete Math. 5 3-51.
    • (1979) Ann. Discrete Math. , vol.5 , pp. 3-51
    • Balas, E.1
  • 4
    • 34249954960 scopus 로고
    • Chvátal closures for mixed integer programming problems
    • Cook, W., R. Kannan, A. Schrijver. 1990. Chvátal closures for mixed integer programming problems. Math. Programming 47 155-174.
    • (1990) Math. Programming , vol.47 , pp. 155-174
    • Cook, W.1    Kannan, R.2    Schrijver, A.3
  • 5
    • 0035252289 scopus 로고    scopus 로고
    • Elementary closures for integer programs
    • Cornuéjols, G., Y. Li. 2001. Elementary closures for integer programs. Oper. Res. Lett. 28 1-8.
    • (2001) Oper. Res. Lett. , vol.28 , pp. 1-8
    • Cornuéjols, G.1    Li, Y.2
  • 6
    • 3843054617 scopus 로고    scopus 로고
    • K-cuts: A variation of Gomory mixed integer cuts from the LP tableau
    • Cornuéjols, G., Y. Li, D. Vandenbussche. 2003. k-cuts: A variation of Gomory mixed integer cuts from the LP tableau. INFORMS J. Comput. 15 385-396.
    • (2003) INFORMS J. Comput. , vol.15 , pp. 385-396
    • Cornuéjols, G.1    Li, Y.2    Vandenbussche, D.3
  • 7
    • 0004119489 scopus 로고
    • An algorithm for the mixed integer problem
    • The RAND Corporation, Santa Monica, CA
    • Gomory, R. E. 1960. An algorithm for the mixed integer problem. Technical report RM-2597, The RAND Corporation, Santa Monica, CA.
    • (1960) Technical Report , vol.RM-2597
    • Gomory, R.E.1
  • 8
    • 0043186220 scopus 로고    scopus 로고
    • Sequence independent lifting in mixed integer programming
    • Gu, Z., G. L. Nemhauser, M. W. P. Savelsbergh. 2000. Sequence independent lifting in mixed integer programming. J. Combinat. Optim. 4 109-129.
    • (2000) J. Combinat. Optim. , vol.4 , pp. 109-129
    • Gu, Z.1    Nemhauser, G.L.2    Savelsbergh, M.W.P.3
  • 9
    • 0035328755 scopus 로고    scopus 로고
    • Aggregation and mixed integer rounding to solve MIPs
    • Marchand, H., L. A. Wolsey, 2001. Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49 363-371.
    • (2001) Oper. Res. , vol.49 , pp. 363-371
    • Marchand, H.1    Wolsey, L.A.2
  • 11
    • 0000689851 scopus 로고
    • A recursive procedure for generating all cuts for 0-1 mixed integer programs
    • Nemhauser, G. L., L. A. Wolsey. 1990. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Math. Programming 46 379-390.
    • (1990) Math. Programming , vol.46 , pp. 379-390
    • Nemhauser, G.L.1    Wolsey, L.A.2
  • 12
    • 0000413764 scopus 로고
    • Facets and strong valid inequalities for integer programs
    • Wolsey, L. A. 1976. Facets and strong valid inequalities for integer programs. Oper. Res. 24 367-372.
    • (1976) Oper. Res. , vol.24 , pp. 367-372
    • Wolsey, L.A.1
  • 13
    • 0003165798 scopus 로고
    • Valid inequalities and superadditivity for 0/1 integer programs
    • Wolsey, L. A. 1977. Valid inequalities and superadditivity for 0/1 integer programs. Math. Oper. Res. 2 66-77.
    • (1977) Math. Oper. Res. , vol.2 , pp. 66-77
    • Wolsey, L.A.1

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