메뉴 건너뛰기




Volumn 6140 LNCS, Issue , 2010, Pages 51-55

Rapid learning for binary programs

Author keywords

[No Author keywords available]

Indexed keywords

BINARY PROGRAMS; CONSTRAINT PROGRAMMING; DISCRETE OPTIMIZATION PROBLEMS; LEARNING APPROACH; ROOT NODES;

EID: 77955460519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13520-0_8     Document Type: Conference Paper
Times cited : (15)

References (13)
  • 4
    • 67651111759 scopus 로고    scopus 로고
    • Propagation via lazy clause generation
    • Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357-391 (2009)
    • (2009) Constraints , vol.14 , Issue.3 , pp. 357-391
    • Ohrimenko, O.1    Stuckey, P.2    Codish, M.3
  • 5
    • 1242308680 scopus 로고    scopus 로고
    • Efficient intelligent backtracking using linear programming
    • Davey, B., Boland, N., Stuckey, P.: Efficient intelligent backtracking using linear programming. INFORMS Journal of Computing 14(4), 373-386 (2002)
    • (2002) INFORMS Journal of Computing , vol.14 , Issue.4 , pp. 373-386
    • Davey, B.1    Boland, N.2    Stuckey, P.3
  • 6
    • 33846579207 scopus 로고    scopus 로고
    • Conflict analysis in mixed integer programming
    • Special issue: Mixed Integer Programming
    • Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optimization 4(1), 4-20 (2007); Special issue: Mixed Integer Programming
    • (2007) Discrete Optimization , vol.4 , Issue.1 , pp. 4-20
    • Achterberg, T.1
  • 7
    • 77955439789 scopus 로고    scopus 로고
    • Information-based branching schemes for binary linear mixed-integer programs
    • Kilinç Karzan, F., Nemhauser, G.L., Savelsbergh, M.W.P.: Information-based branching schemes for binary linear mixed-integer programs. Math. Progr. C 1(4), 249-293 (2009)
    • (2009) Math. Progr. C , vol.1 , Issue.4 , pp. 249-293
    • Kilinç Karzan, F.1    Nemhauser, G.L.2    Savelsbergh, M.W.P.3
  • 8
    • 69849086853 scopus 로고    scopus 로고
    • Hybrid branching
    • van Hoeve,W.-J., Hooker, J.N. (eds.) CPAIOR 2009. Springer, Heidelberg
    • Achterberg, T., Berthold, T.: Hybrid branching. In: van Hoeve,W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 309-311. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5547 , pp. 309-311
    • Achterberg, T.1    Berthold, T.2
  • 10
    • 44649159102 scopus 로고    scopus 로고
    • Constraint integer programming: A new approach to integrate CP and MIP
    • Perron, L., Trick, M.A. (eds.) CPAIOR 2008. Springer, Heidelberg
    • Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: A new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 6-20. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5015 , pp. 6-20
    • Achterberg, T.1    Berthold, T.2    Koch, T.3    Wolter, K.4
  • 11
    • 0002027106 scopus 로고    scopus 로고
    • An updated mixed integer programming library: MIPLIB 3.0
    • Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.: An updated mixed integer programming library: MIPLIB 3.0. Optima (58), 12-15 (1998)
    • (1998) Optima , Issue.58 , pp. 12-15
    • Bixby, R.E.1    Ceria, S.2    McZeal, C.M.3    Savelsbergh, M.W.4


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