Pages that link to "Item:Q1339141"
From MaRDI portal
The following pages link to Lower bounds for the quadratic assignment problem (Q1339141):
Displaying 10 items.
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- Generating quadratic assignment test problems with known optimal permutations (Q1203071) (← links)
- A comparison of formulations and relaxations for cross-dock door assignment problems (Q1652605) (← links)
- Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- Two-level modified simulated annealing based approach for solving facility layout problem (Q3498919) (← links)
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study (Q5131726) (← links)
- Gilmore-Lawler bound of quadratic assignment problem (Q6059115) (← links)
