A new lower bound for the quadratic assigment problem

A new lower bound for the quadratic assigment problem

0.00 Avg rating0 Votes
Article ID: iaor1990682
Country: United Kingdom
Volume: 27
Start Page Number: 1
End Page Number: 7
Publication Date: Mar 1987
Journal: USSR Computational Mathematics and Mathematical Physics
Authors:
Abstract:

A new integer model for the quadratic assignment problem, equivalent to the original problem, is proposed and lower and upper bounds are established for it. These bounds may be used in algorithms of the pair-wise assignment group.

Reviews

Required fields are marked *. Your email address will not be published.