1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows Theory: Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
2. Applegate, D., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
3. Arthanari, T.S.: On the Membership Problem of Pedigree Polytope. In: Neogy, S.K., Bapat, R.B., Das, A.K., Parthasarathy, T. (eds.) Mathematical Programming and Game Theory for Decision Making, pp. 61–98. World Scientific, Singapore (2008)
4. Arthanari, T.S.: A Comparison of the Pedigree Polytope with the Symmetric Traveling Salesman Polytope. In: The Fourteenth International Conference of the FIM, Chennai, India, pp. 6–8 (2007)
5. Arthanari, T.S.: On Pedigree Polytopes and Hamiltonian Cycles. Discrete Mathematics 306, 1474–1492 (2006)