Pages that link to "Item:Q1388830"
From MaRDI portal
The following pages link to Lower bounds for the quadratic semi-assignment problem (Q1388830):
Displayed 8 items.
- Algorithm for the discrete Weber's problem with an accuracy estimate (Q329214) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- A polynomially solvable class of quadratic semi-assignment problems (Q1278260) (← 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)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Algorithm for quadratic semi-assignment problem with partition size coefficients (Q2448190) (← links)
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms (Q2564758) (← links)