Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach
From MaRDI portal
Publication:1850122
DOI10.1016/S0166-218X(01)00333-XzbMath1005.90042OpenAlexW2074981034MaRDI QIDQ1850122
Tania Maia Querido, Elizabeth Ferreira Gouvea, Nair Maria Maia De Abreu, Paulo Oswaldo Boaventura-Netto
Publication date: 2 December 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00333-x
Related Items (2)
A survey for the quadratic assignment problem ⋮ Measuring instance difficulty for combinatorial optimization problems
Uses Software
Cites Work
- The quadratic assignment problem. Theory and algorithms
- On the quality of local search for the quadratic assignment problem
- Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
- Assignment Problems and the Location of Economic Activities
- An Algorithm for the Quadratic Assignment Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach