Author:
Montemanni Roberto,Barta János,Smith Derek H.
Publisher
Springer International Publishing
Reference29 articles.
1. Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Operations Research Letters, 9 375–382 (1990)
2. Montemanni, R.: Combinatorial optimization algorithms for the design of codes: a survey. Journal of Applied Operations Research 7(1):36–41 (2015)
3. Deza, M., Vanstone, S.A.: Bounds for permutation arrays. Journal of Statistical Planning and Inference 2 197–209 (1978)
4. Blake, I.F.: Permutation codes for discrete channels. IEEE Transactions on Information Theory 20(1) 138–140 (1974)
5. Bogaerts, M.: New upper bounds for the size of permutation codes via linear programming. The Electronic Journal of Combinatorics 17(#R135) (2010)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献