Polynomial algorithms for solving the quadratic assignment problem on networks

DOI10.1134/S0965542510110175zbMATH Open1224.90119OpenAlexW2074501059MaRDI QIDQ2996038FDOQ2996038

Authors: Gennady Grigorjevich Zabudsky, A. Yu. Lagzdin 

Publication date: 4 May 2011

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542510110175

Recommendations

• Polynomial algorithms for solving the quadratic bottleneck assignment problem on networks
• A contribution to quadratic assignment problems
• Network-based formulations of the quadratic assignment problem
• Dynamic programming for the quadratic assignment problem on trees
• scientific article; zbMATH DE number 1302195

zbMATH Keywords

graphsnetworksquadratic assignment problemfacility location problempolynomial algorithms

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cited In (6)

• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
• Title not available (Why is that?)
• POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
• Polynomial algorithms for the synthesis of bounded nets
• An extreme point algorithm for a local minimum solution to the quadratic assignment problem
• Dynamic programming for the quadratic assignment problem on trees

This page was built for publication: Polynomial algorithms for solving the quadratic assignment problem on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996038)