Reference65 articles.
1. Achterberg T (2007) Conflict analysis in mixed integer programming. Discrete Optim 4(1):4–20 Special issue: Mixed Integer Programming
2. Achterberg T (2008) SCIP: solving constraint integer programs. Math Program Comput 1(1):1–41
3. Achterberg T, Berthold T (2009) Hybrid branching. In: van Hoeve WJ, Hooker J (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, 6th international conference, CPAIOR 2009. Lecture notes in computer science, vol 5547. Springer, Berlin, pp 309–311
4. Achterberg T, Berthold T, Koch T, Wolter K (2008) Constraint integer programming: a new approach to integrate CP and MIP. In: Perron L, Trick M (eds) Proceedings of the conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CP-AI-OR). Lecture notes in computer science, vol 5015. Springer, Berlin, pp 6–20
5. Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper Res Lett 33:42–54
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Logic-Based Benders Decomposition for Large-Scale Optimization;Springer Optimization and Its Applications;2019
2. Integrated Methods for Optimization;International Series in Operations Research & Management Science;2012