Experimental analysis of algorithms for the independent quadratic assignment problem

DOI10.1016/J.COR.2024.106704MaRDI QIDQ6979452zbMATH OpenFDO

Authors Wei Yang, Yang Wang, Ante Ćustić, Abraham P. Punnen

Publication date 26 May 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106704

zbMATH Keywords

independent quadratic assignmentpath-relinkingquadratic assignmentvery large-scale neighborhood search

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
• Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
• Combinatorial optimization with interaction costs: complexity and solvable cases
• GRASP with path relinking for three-index assignment
• GRASP with path-relinking for the TSP
• scientific article; zbMATH DE number 1302195 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Polynomially solvable cases of the bipartite traveling salesman problem
• The bilinear assignment problem: complexity and polynomially solvable special cases
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• The quadratic assignment problem. Theory and algorithms

This page was built for publication: Experimental analysis of algorithms for the independent quadratic assignment problem

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