메뉴 건너뛰기




Volumn 6655 LNCS, Issue , 2011, Pages 183-191

Backdoor branching

Author keywords

[No Author keywords available]

Indexed keywords

BLACK BOXES; BRANCHING TREE; COMPUTATIONAL RESULTS; FRACTIONAL SOLUTIONS; SET-COVERING MODEL;

EID: 79959968238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20807-2_15     Document Type: Conference Paper
Times cited : (23)

References (8)
  • 1
    • 62249219958 scopus 로고    scopus 로고
    • PhD thesis, Technische Universität Berlin; Fakultät II - Mathematik und Naturwissenschaften. Institut für Mathematik
    • Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universität Berlin; Fakultät II - Mathematik und Naturwissenschaften. Institut für Mathematik (2007)
    • (2007) Constraint Integer Programming
    • Achterberg, T.1
  • 5
    • 69849086850 scopus 로고    scopus 로고
    • Backdoors to Combinatorial Optimization: Feasibility and Optimality
    • van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. Springer, Heidelberg
    • Dilkina, B., Gomes, C.P., Malitsky, Y., Sabharwal, A., Sellmann, M.: Backdoors to Combinatorial Optimization: Feasibility and Optimality. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 56-70. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5547 , pp. 56-70
    • Dilkina, B.1    Gomes, C.P.2    Malitsky, Y.3    Sabharwal, A.4    Sellmann, M.5
  • 7
    • 79960020368 scopus 로고    scopus 로고
    • Preliminary version
    • MIPLIB 2010. Preliminary version, http://miplib.zip.de/
    • MIPLIB 2010


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