Symmetric matrices of huge size with many zero entries, called sparse symmetric matrices, are nowadays studied actively in the context of artificial intelligence and data science. One of the efficient ...

For the distance matrix of symmetric traveling salesman problems a simple transformation into an equivalent asymmetric one is given. Assignment algorithms yield sharper lowerbounds and less subtours ...