This is a preview. Log in through your library . Abstract We introduce a new lower bound for the quadratic assignment problem based on a sequence of equivalent formulations of the problem. We present ...
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
Feedback