Hybrid Branching-Reference-Cited by-同舟云学术

Hybrid Branching

Published:2009 Issue: Volume: Page:309-311
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Achterberg Tobias,Berthold Timo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-01929-6_23

Reference6 articles.

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. Lecture Notes in Computer Science;C.M. Li,1997

5. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. of Comp. 48, 506–521 (1999)

Cited by 50 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model;Lecture Notes in Computer Science;2024

2. MILP Acceleration: A Survey from Perspectives of Simplex Initialization and Learning-Based Branch and Bound;Journal of the Operations Research Society of China;2023-07-03

3. On computing small variable disjunction branch-and-bound trees;Mathematical Programming;2023-05-13

4. Branch-and-cut solution approach for multilevel mixed integer linear programming problems;EURO Journal on Computational Optimization;2023

5. A survey for solving mixed integer programming via machine learning;Neurocomputing;2023-01