The quadratic assignment problem. I: New lower bounds in paired assignment
From MaRDI portal
Publication:1881944
zbMath1057.90536MaRDI QIDQ1881944
Publication date: 18 October 2004
Published in: Automation and Remote Control (Search for Journal in Brave)
Related Items (4)
Algorithm for the discrete Weber's problem with an accuracy estimate ⋮ The symmetric travelling salesman problem. II: New low bounds ⋮ Dynamic programming for the quadratic assignment problem on trees ⋮ Unnamed Item
This page was built for publication: The quadratic assignment problem. I: New lower bounds in paired assignment
