Pages that link to "Item:Q1926740"
From MaRDI portal
The following pages link to A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740):
Displaying 7 items.
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
