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 ...

Business managers face an endless list of complex issues every day. They must make decisions about financing, where to build a plant, how much of a product to manufacture, how many people to hire, and ...