Publisher
Springer Berlin Heidelberg
Reference118 articles.
1. F.A. Aloul, A. Ramani, I.L.Markov, and K.A. Sakallah, Solving difficult instances of Booleansatisfiability in the presence of symmetry, IEEE Transactions on CAD 22 (2003) 1117–1137.
2. K.M. Anstreicher, Recent advances in the solution of quadratic assignment problems, Mathematical Programming 97 (2003) 27–42.
3. D.L. Applegate, R.E. Bixby, V. Chvátal, and W.J. Cook, The Traveling Salesman Problem, A Computational Study, Princeton, 2006.
4. A. von Arnim, R. Schrader, and Y. Wang, The permutahedron of N-sparse posets, Mathematical Programming 75 (1996) 1–18.
5. L. Babai, E.M. Luks, and Á. Seress, Fast management of permutation groups I, SIAMJournal on Computing 26 (1997) 1310–1342.
Cited by
88 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献