Hybrid branching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5547 LNCS, Issue , 2009, Pages 309-311

  Achterberg, Tobias ^a   Berthold, Timo ^b  

^a IBM   (Germany)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CONSTRAINT SATISFACTION PROBLEMS; MIXED-INTEGER PROGRAMS; SATISFIABILITY PROBLEMS; SELECTION RULES; SUB-PROBLEMS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTER OPERATING PROCEDURES; COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; PLASMA WAVES;

INTEGER PROGRAMMING;

EID: 69849086853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01929-6_23     Document Type: Conference Paper

References (6)

1. Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation (1) (2008)
2. Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters 33, 42-54 (2005)
3. Karzan, F.K., Nemhauser, G., Savelsbergh, M.: Information based branching rules in integer programming. Presentation at INFORMS Annual Meeting (2008)
4. Li, C.M., Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol.1330, pp. 342-356. Springer, Heidelberg (1997)
5. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. of Comp. 48, 506-521 (1999)
6. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of the DAC (July 2001)