Because of its specificity, it is usually difficult to reuse computer code developed for a given combinatorial problem to deal with another one. We use the Object Oriented Programming methodology to ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results