Subject
Signal Processing,Control and Systems Engineering,Software
Reference29 articles.
1. Aguilera, N.E., Katz, R.D., and Tolomei, P.B., Vertex adjacencies in the set covering polyhedron, Discrete Appl. Math., 2017, vol. 218, pp. 40–56. https://doi.org/10.1016/j.dam.2016.10.024
2. Applegate, D.L., Bixby, R.E., Chvátal, V., and Cook, W.J., The Traveling Salesman Problem: A Computational Study, Princeton Univ. Press, 2006.
3. Arthanari, T.S., On pedigree polytopes and Hamiltonian cycles, Discrete Math., 2006, vol. 306, no. 14, pp. 1474–1492. https://doi.org/10.1016/j.disc.2005.11.030
4. Arthanari, T.S., Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope, Discrete Optim., 2013, vol. 10, no. 3, pp. 224–232. https://doi.org/10.1016/j.disopt.2013.07.001
5. Bae, M.M. and Bose, M., Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes, IEEE Trans. Comput., 2003, vol. 52, no. 10, pp. 1271–1284. https://doi.org/10.1109/TC.2003.1234525