Quadratic assignment problem and packing graphs

Quadratic assignment problem and packing graphs

0.00 Avg rating0 Votes
Article ID: iaor20043263
Country: Belarus
Volume: 2
Start Page Number: 109
End Page Number: 112
Publication Date: Jun 2003
Journal: Proceedings of the National Academy of Sciences of Belarus
Authors: ,
Keywords: optimization
Abstract:

The approach to construction of new heuristic algorithms for the qaudratic assignment problem is developed. The approach is based on the results about packing graphs and shortest trees under constraints on their configuration.

Reviews

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