Pages that link to "Item:Q1278260"
From MaRDI portal
The following pages link to A polynomially solvable class of quadratic semi-assignment problems (Q1278260):
Displaying 9 items.
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- Algorithm for the discrete Weber's problem with an accuracy estimate (Q329214) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
- Room allocation: a polynomial subcase of the quadratic assignment problem (Q1765233) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints (Q2108178) (← links)
- Algorithm for quadratic semi-assignment problem with partition size coefficients (Q2448190) (← links)
