Pages that link to "Item:Q2339837"
From MaRDI portal
The following pages link to A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837):
Displaying 6 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem (Q510938) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
- Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)
