Author:
Bui Quoc Trung,Deville Yves,Pham Quang Dung
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference54 articles.
1. Achterberg, T., & Berthold, T. (2009). Hybrid branching. In Proceeding of the 6th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (pp. 309–311).
2. Achterberg, T., Koch, T., & Martin, A. (2005). Branching rules revisited. Operations Research Letters, 33(1), 42–54.
3. Aráoz, J., Fernández, E., & Meza, O. (2007) A simple exact separation algorithm for 2-matching inequalities. Research Report DR-2007/13, EIO Departement, Technical University of Catalonia (Spain). http://www.optimization-online.org/DBHTML/2007/11/1827.html .
4. Ascheuer, N., Jünger, M., & Reinelt, G. (2000). A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Computational Optimization and Applications, 17(1), 61–84.
5. Balas, E., Ceria, S., & Cornuéjols, G. (1996). Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Management Science, 42(9), 1229–1246.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献